I want to know question number 7.

I would be grateful if you could help me with the details. I am really confused about this assignment. And please don't copy other answers to here.

7. The following productions define the LL(1) grammar G. Given the First and Follow sets of G, complete the LL(1) parse table and parse the input string 'a d b f e $$, (' $ ' is the empty stack symbol). (10) Productions 1. SABC 2. Aa 3. AbC 4. A 5. BC 6. BdA 7. B 8. Ce 9. Cf LL(1) Parse Table (Enter the production number or ERR for error actions)