a) The input undirected graph is

6

A B C D E F G

9

A B 6 A C 2 A D 4 A E 11

B E 1

C E 8 C F 1

D F 2

E G 4

F G 5

represent an edge from A to B ,the weight of the edge is 6

(1)Draw the adjaceny list of graph(5)

(2)Wirte the order of breadth-first search from A(4);

(3)Write the order of depth-first search start from A(4).

(4)Draw the minimal spanning tree using Prim algorithm.(assume start

from B, draw the process of the algorithm)(10)