Let G = (V, E, R, S) be a context-free grammar, where V = {S, T}, E = {0, #}, and R is the following set of rules:

S TT

T 0T | T0 | #

(a) Give a rightmost derivation in G for the string 00#0#00.

(b) Give a parse tree in G for the string 00#0#00 that represents a different rightmost derivation from the one in (a).