Proof for Context Free Grammar

Consider the grammar G = (NT, S, R, S) where NT = {S, T}, S = {0, 1}, and the rules in R are as follows: 1) S -> 1S1 2) S -> 0T 3) T -> 1T1 4) T -> 0 Prove that L(G) = LA = {1i 01j 01i+j | i, j ≥ 0} in two parts as attached.