SOLVED: When giving the algorithm, write a pseudo-code of the algorithm, similar to what we discussed in the class for BFS, DFS, or other algorithms. When writing a proof, write the steps with enough explanations. Problem 2 of the textbook: Recall the problem of finding the number of inversions. As in the text, we are given a sequence of n numbers a1, · · · , an, which we assume are all distinct, and we define an inversion to be a pair i aj. We motivated the problem of counting inversions as a

Write an algorithm in pseudocode to find the value of x^n, when x and n are two given integers. | Numerade