Thumb up for the solution, thx!

Graphs (5 marks) a) Given an undirected graph G with a vertex set of (a,b,c,d), the edges are given by (a,b), i. Show the adjacency list for graph G ii. Show the adjacency matrix for graph G. b) In a social network with 10 million users, each user has up to 1000 friends, if we represent the social network as a graph, with a vertex for each user and an edge for the friendship between two users, would you choose to use an adjacency list or an adjacency matrix for storing this graph. Explain your answer in one sentence. c) Find the shortest path from node 1 to node 7 in the graph below, using Dijkstra's algorithm. You should show each step clearly 20 10 8