Plz solve 3A

3A. i)Consider the following graph in Fig 3A, starting at vertex"a' and resolving ties by visiting the vertex in alphabetical order, traverse the graph by breadth-first search and construct the corresponding breadth-first search forest. Give the order in which the vertices were visited ie, added to (or removed from) the queue. Fig. 3A i) Write the algorithm to perform straight insertion sort. Trace it to sort the following list in alphabetical order: M, A, N, G, A, L, O, R, E 3B. i) compare the orders of growth of log/l and using limits i) Give the weight matrix and adjacency list representation for the graph in Fig 3B. (I)