Justify each answer. Write pseudocode for an algorithm that interchanges the values of the variables m and n, using only assignments (assigning values to variables).

Justify each answer.

1. Write pseudocode for an algorithm that interchanges the values of the variables m and n, using only assignments (assigning values to variables).
   
   
2. Arrange the functions (1.5)ⁿ, n¹⁰⁰, (log₂n)³, 10ⁿ, n!, and n⁹⁹ so that each function is big-O of the next function.
   
   
3. Give a big-O estimate for the following algorithm:

count = array of k + 1 zeros

for x in input do

     count[key(x)] + = 1

end for

total = 0

for i in 0,1,...k do

      count[i], total = total, count[i] + total

end for

output = array of the same length as input

for x in input do

     output[count[key(x)]] = x

     count[key(x)] + = 1

end for return output