QUESTION 3: [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 117 14 10 4 25 5 B- [2 POINTS] How many times the max-heapify function is called through the entire sorting. QUESTION 2: [7 POINTS] Given the following adjacency matrix representation of a graph to answer the followed questions. 011 0 1 1 001 0 1 000 1 0 1 0 0 1 1 0 1 1 0 A. [1 POINT) is it directed graph or not and why? B. (1 POINT] How many vertices are there in the graph? C. [I 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 QUESTION 4: [17 POINTS] We consider the directed graph G = (V, E) shown below, and assume that the adjacency lists for all vertices are sorted by increasing vertex indices. DA 6 8 A) [8 POINTS] Run DFS(G) and show discovery time, finish time and predecessor for each node. And show the DFS forest. B) [2 POINTS] How many times in total has DFS-Visit has been called? C) [7 POINTS] Run BFS (G, O) starting with source 0. Show the Queue after each step. Show also d[], p[] lists and BFS tree