What is ambiguous grammar? Explain the “Dangling Else” problem with example. Show how to resolve it.

Construct the LL(1) parsing table for the following grammar (after removing left recursion if needed):

E → E + T | T

T → T * F | F  

F → (E) | id

Parse the string id + id * id using this table.