Given the graph G $=($V$,$ E$)$ as shown in Figure $1,$ using your algorithm

to decide if G contains an odd cycle in G$.$ Please write down the output. The

answer can be either $$G contains an odd cycle$$ or $$G does not contain any odd

cycles$.$ Suppose the vertices are explored in lexicographic order starting from

vertex a$.$ please list the first odd cycle found in your algorithm if your algorithm

returns $$G contains an odd cycle$.$Figure $1$: Problem $4($b$)$