$10$

Determine the order in which an inorder traversal visits the vertices of the given ordered rooted tree.

Multiple Choice

$d,b,a,e,g,f,c$

$e,b,f,d,g,a,c$

$d,b,f,e,g,a,c$

$d,b,f,e,c,a,g$