The map of Silicon Valley area is displayed in Figure11-18 (next pae. You are not asked to write C programs to solve the following questions You just need to draw pictures and write down your answers a. Convert the map to a network. You may label any not named vertices as A, B Draw the network b. Define C struct for vertex and are, which can be used to store the network represented by adjacency list, and find the shortest paths. You may do some changes from the definitions of the graph ADT in text. c.Store the network to a graph using adjacency list. Draw the adjacency list for the network similar to Figure 11-19 in text page 514 (but don't need the adjacency matrix) d. Find out the shortest paths tree from the city San Rafael to other cities FIGURE 11-28 Map of Silicon Valley Aroo