Theory of computation: Considering this grammar, construct:

Consider the grammar: S right arrow i C t S S right arrow i C t S e S S right arrow a C right arrow b where i, t, and, e stand for if, then, and else, and C and S for "conditional" and "statement." Construct a rightmost derivation for the sentence w = i b t i b t a e a. Show the corresponding parse tree for the above sentence. Is the above grammar ambiguous? If so, prove it