What is the space complexity of Heap Sort?

Program to implement heap sort

Write an algorithm/pseudocode to sort elements using Heap sort technique?

An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in the order ofNote: This kind of question will be helpful in clearing Infosys recruitment.

What is the space complexity of this function / algorithm?int **allocate_map(int n, int m){ int **map; map = malloc(sizeof(int *) * n); for (size_t i = 0; i < n; i++) { map[i] = malloc(sizeof(int) * m); } return (map);}O(1)O(nm)O(n^2)O(log(n))I don't knowSubmit

What is the time complexity of the Bubble Sort algorithm used in this program? (Bonus the Answer is C)*1 pointA. O(n)B. O(n log n)C. O(n^2)D. O(1)What is the value of 'n' after sorting the array?*1 pointA. 10B. 9C. 11D. sizeof(arr)If the array had all elements equal, what would be the best-case time complexity of the Bubble Sort algorithm?(Bonus Answer is A)*1 pointA. O(n)B. O(n log n)C. O(n^2)D. O(1)