Can I have the pseudocode for the algorithm? ( With explanation )

EE2008/IM1001: Data Structures and Algorithms Homework assignment 2 problem:We are given a sequence of numbers xvX2-m %-we scan these numbers from ft to right, and putxi to left of x+1 if x, is smaller than x to th to resolve this sorting problem. . In other words, we continuously move e left until the numbers to its left are all smaller than or equal to it. Design an algorithm (20 Marks) Please analyze the time complexity of your above designed algorithm, in terms of both the best case and worst case complexities. 2. (10 Marks) Towers of Hanoi problem: There is a board with three pegs and three disks of different sizes (see Figure 1). The goal of the game is to move the three disks from the peg where they have been placed (largest disk on the bottom, smallest disk on the top) to one of the empty pegs, subject to the following constraints 3. Only the top disk on a peg can be moved to another peg A larger disk cannot be placed on top of a smaller disk. a. b. Figure 1: Towers of Hanoi Design an algorithm to handle the Towers of Hanoi problem. (20 Marks)