In-class: LL(1)

Eliminate left-recursion in the following grammar. Then, generate the first and follow sets. Is the grammar LL(1)?

(1) E → E + T | T
(2) T → T * F | F
(3) F → (E) | id

Save your answers in a PDF and submit to Moodle. Include all names from the group at the top.