Given is the following grammar G: Progaction Progif Cond then Prog Progif Cond then Prog else Prog Cond bool Prove constructively that G is ambiguous. - Hint: utilize the Definition of "ambiguous" Problem (9) (8 points) Let X, X2,, X64 be i.i.d. random variables from Normal( = -3, o = 25). (a) (1 points) Compute E[-2X - 3X3]. (b) (1 point) Compute E[X]. (c) (1 point) Compute Var[-3X2 - 2X3]. (d) (1 point) Compute Var[X]. (e) (1 point) Compute (f) (1 point) Compute (g) (1 point) Compute (h) (1 point) Compute E - fl E 0/8 X Var [87] 0/8 X [(*)] X - Var (87) 0/8