Refer to the adjancency list below for the following questions. A → C → D; B → C → F; C → A → B; D → A → E → F; E → D → F; F → B → D → E i. For the above adjacency list representation of a graph, draw the corresponding graph. ii. How many vertices, n, does the graph have? iii. How many edges, m, does the graph have? iv. How many connected components does the graph have? v. Give a path of length 5 which does not repeat any edges from vertex B to vertex E. vi. Give the shortest path from vertex B to vertex E. vii. Is this graph a tree? Justify your answer. viii. Does the graph contain an Euler trail? If yes, list one such trail. If no, explain why not. (Reminder: an Euler trail is a trail that traverses every edge while allowing for vertices to be revisited.) ix. Show the Adjacency Matrix of the graph above. Order the vertices alphabetically (so the first row and column correspond to A, the second row and column correspond to B, ...).
