NOTE: Answers should be brief, I'm not expecting long answers to make your job easier.
"DATA BASE MANAGEMENT SOLUTIONS BOOK - I really need to answer this question ASAP:
Exercise 20.4 The Globetrotters Club is organized into chapters. The president of a chapter can never serve as the president of any other chapter, and each chapter gives its president some salary. Chapters keep moving to new locations, and a new president is elected when (and only when) a chapter moves. This data is stored in a relation G(C,S,L,P), where the attributes are chapters (C), salaries (S), locations (L), and presidents (P). Queries of the following form are frequently asked, and you must be able to answer them without computing a join: "Who was the president of chapter X when it was in location Y ?"
1. List the FDs that are given to hold over G.
2. What are the candidate keys for relation G?
3. What normal form is the schema G in?