Answer Happy

Data Structures java
I need the answer as soon as possible Please.
Question 1: Graph Representation, shortest path tree. For below directed graph, 5 10 20 A 3 2 15 с A) Draw the adjacency matrix representation. B) Draw the adjacency list representation. C) If a pointer requires four bytes, a vertex label requires two bytes, and an edge weight requires two bytes, which representation requires more space for this graph? Why? D) Please use Dijkstra's shortest path algorithm to show how to find the shortest path tree for starting node A.