04 (b) (4). Give Big-Oh notation for the following problems. For partial credit explain your algorithm. Given an array of integers of size N, if we use a min-heap to sort integer data in ascending order, what would be the run-time? Given an array of integer values of size 2N where all the data is already sorted in descending order. Give most efficient way of reversing the contents of this array so that the items in array would be sorted in ascending order. What will be the run time of sorting an integer array with size N if we use an AVL tree for it? Find the in-degree of a vertex if an adjacency list of a directed graph is given? (use E or V a instead of N in your answer)