Question 6 A graph is a collection of nodes, called vertices and a collection of segments, called lines, connecting pairs of vertices. In other words, a graph consists of two sets, a set of vertices and a set of lines. (a) State TWO (2) differences between graph data structure and tree data structure. (4 marks) (b) Consider the adjacency list of a directed graph shown in Figure 3. Figure 3: Adjacency list i. Draw the directed graph that has the adjacency list shown in Figure 3. ii. Draw the adjacency matrix for the directed graph that has the adjacency list shown in Figure 3. (6 marks iii. If a depth- first traversal were performed starting at vertex A, and visit are to be made in alphabetical order by vertex name where possible, in what order would vertices be visited? Draw appropriate diagram to show how you get the result. b) Consider the adjacency list of a directed graph shown in Figure 3. Figure 3: Adjacency list i. Draw the directed graph that has the adjacency list shown in Figure 3