Topic : Data Structures- Graphs: in programming

Thanks in advance :))

I need it a bit asap im ruinnning out of due time.

Question 3 P Q R U w Y P 1 0 0 0 0 Q 0 0 1 0 0 0 0 R 0 s 0 0 1 0 S T U V W X 0 1 1 0 0 1 0 0 0 0 0 a| 1||| R 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 v 0 0 0 0 0 0 1 1 0 wo W 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 1 T 0 0 U V 0 1 0 0 Y 0 1 0 a. Given the above adjacency matrix: i. Draw the equivalent adjacency list. [2] ii. Draw the equivalent graph. [2] iii. Calculate the indegree and outdegree of each vertex of the graph. [1]