Using the pseudocode conventions of the textbook, write an 0(n) algorithm to find and return the maximum value of an array that contains n numbers. Write a comment between each pair of lines describing what is true when the program reaches that point in your code. What is the minimum number of bits that are needed to encode an integer in the range -1000 to 1000? From -1000000 to 1000000? From - n to n, where n is a positive integer? Rank the following 12 functions by order of growth. f_1(n) = lg n f_2(n) = n^2 f_3(n) = 2^n All the functions for f_i{f_j 1,2,3} and j {1,2,3} Consider the insertion sort algorithm presented in the book. Assume that A contains n distinct numbers. If A is sorted in ascending order, determine the number of times each line is executed. Assuming that the cost of each line is c, what is the total running time? Show the result in a way similar to the top of p. 26. If A Ls sorted in descending order, determine the number of times each line is executed. Assuming that the cost of each line is c, what Ls the total running time? Show the result in a way similar to the top of p. 26