Determine whether the undirected graphs shown in the following figure have an Euler circuit. If no Euler circuit exists, determine whether the undirected graphs have an Euler path. Justify. G3 G I H B T M P E R G2 BC In which order are the vertices of the T rooted tree (root =P) visited using a preorder and a postorder traversal? In which order are the vertices of the T2 rooted tree (root = A) visited using a inorder traversal? S P W L H M C T