Given the following grammar:

$EE+E|E$&$E|$ true $|$ false

where,,$+$&$,$ true, and false are terminals.

$($a$)$ Show an example case to prove that this grammar is ambiguous.

$($b$)$ Consider the production $EE+E|$ true $|$ false, which involves left recursion.

Please rewrite this production $($not the whole grammar$)$ to eliminate left recursion

and use right recursion only.