Consider the following ordered rooted tree:

In which order are the vertices of the tree visited using a postorder traversal?

Multiple Choice

$b,g,n,s,r,f,e,m,l,k,a,d,J,q,,l,h,o,c$

$a,d,J,q,p,l,h,o,c,b,g,n,s,r,f,e,m,l,k$

$o,h,l,p,q,J,d,a,c,k,l,m,e,f,r,s,n,g,b$

$k,l,m,e,f,r,s,n,g,b,c,o,h,l,p,q,J,d,a$