Please solve this quastions quickly

1: Given Given the following adjacency matrix representation of a graph to answer the followed questions. 1 0 1 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 A. [1 POINT] is it directed graph or not and why? B. [1 POINT] How many vertices are there in the graph? C. [1 POINT] How many edges are there in the graph? D. [3 POINT] reRepresent the graph using an adjacency list. E. [1 POINT] Draw the original graph 2: [6 POINTS] A- [4 POINTS] Apply heap sort in the following array and show your work over the tree you build. Show all your steps. 18 13 11 7 14 10 4 25 5 B- [2 POINTS] How many times the max-heapify function is called through the entire sorting