I solved this question in below way
Find what given grammar generates
S→AA
A→0A∣A0∣1
1)S→AA & A→0A & A→1 generates 0i10j1
2)S→AA & A→0A & A→A0 & A→1 generates 0i10j10.
3)S→AA & A→A0 & A→0A & A→1 generates 0i1000j1.
4)S→AA & A→A0 & A→A0 & A→1 generates 0i100j10.
5)S→B & B→0B00∣1 generates 0i102i
option A not correct as we have strings which ends with 1
option B not correct as in included extra strings which end with multiple 0, whereas our string ends with at most one zero
option C not correct as we have string which has some 0 in between two zeros
option D not correct as we don't get just 00
hence ans is none of above