Consider the US state map below.

a) Draw the graph showing the connectivity of only the following six states:

Idaho, Montana, Nevada, Oregon, Utah, Washington

(Each state becomes a vertex, and an edge exists between neighboring states)

b) Draw the adjacency list representation of the above graph. For simplicity, you may just complete the following table. The first line is already completed.

Vertex	Adjacency list of the vertex
Washington	(Idaho,Oregon)

c) Draw the adjacency matrix representation of the above graph. It is sufficient to show only the boolean adjacency matrix. Number the states like so: Idaho (0), Montana (1), Nevada (2), Oregon (3), Utah (4), Washington (5).

d) Give the DFS traversal of the above graph starting from Washington (i.e., list the nodes in the order they are visited). Edges should be explored in alphabetical (lexicographic) order of their endpoints.

e) Give the BFS traversal of the above graph starting from Washington (i.e., list the nodes in the order they are visited). Edges should be explored in alphabetical (lexicographic) order of their endpoints.

Washington North Dakota Montana Ma Oregon Ver New Minnesota ampshire assachusetts . Idaho New York South Dakota Wisconsi Rhode Island Connecticut Wyoming NevadaUtah lowa Pennsylvania. Nebraska llinois.ohio West ersey Dolaware alifornia Colorado Indiana.Virginia Maryland Missouri Kentucky Tenncs Virginia No Kansas Carolina Arizona Mexico New Oklahoma Arkansas .South Goorgia Carolina Mississippi. Alabama Texas Hawaii Alaska