Problem 4/9 (10 points) Given positive integer n, design an algorithm with the time complexity of O(n) to calculate the sum of all the divisors of n. Write down the pseudocode. skakakaka kakk k kkkkkkkkkkkkkkkk Problem 5/9 (6 points) Convert array A= into a max-heap and draw the max-heap