Graph Search B E Figure 1: Graph for Problem 2 Refer to the graph in Figure ?? for the following problems. i. Write this graph as an adjacency list. ii. Write this graph as an adjacency matrix. iii. List the vertices visited performing depth-first search from B assuming that vertices are pro- cessed in alphabetical order, and already visited nodes are not visited again. iv. List the vertices visited performing breadth-first search from B assuming that vertices are processed in alphabetical order, and already visited nodes are not visited again.