Hello this a textbook question I would like some help with. This deals with CS algorithms.

1. Solve the Towers of Hanoi game for the following graph G=(V,E) with V={Start, Aux1, Aux2. Aux3, Aux4, Dest) and E = {(Start, Aux1), (Aux1,Aux2), (Aux2, Aux3), (Aux3,Aux4), (Aux4, Auxl), (Aux1,Dest)}. (a) Design an algorithm and determine the time and space complexities of moving n disks from Start to Dest. (b) Implement this algorithm whereby your program prints out each of the moves of every disk. Show the output for n=1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. (If the output is too long, print out only the first 100 and the last 100 moves.) 2. Determine for the following code how many pages are transferred between disk and main memory, assuming each page has 2000 words, the active memory set size is 1000 (i. e., at any time no more than 1000 pages may be in main memory), and the replacement strategy is LRU (the Least Recently Used page is always replaced); also assume that all two- dimensional arrays are of size (1:2000, 1:2000), with each array element occupying one word, N=2000 for I := 1 to 4000 do for J :=1 to 4000 do { A[I,J]:=A[I,J] *B[I,J]; B[I,J]:=C[N-I+1,J]*B(I,J] } provided the arrays are mapped into the main memory space (a) in row-major order, (b) in column-major order