Number of derivation trees

Question

`How many derivation trees are there to derive string"te" from below grammer:-

G->ATE | g | $\epsilon$

A->TE | a | $\epsilon$

T-> t | $\epsilon$

E-> e | $\epsilon$

Comments

i am getting 4.

---

It's 4.

Answer 1

 

4 tree are possible

Answer 2

.........