Data Structure Algorithm. We must write algorithm that will invert the triangle

1. Three disks are arranged to form an upward pointing triangle. Write an algorithm that will invert the triangle. That is, list numbered steps that indicate which disk(s) are moved and which positions they are moved to. A move' is any one disk being shifted from its current location to any new position which was empoy ABCDEFGH x X 9 10 Xx 12 13 14 15 16 X 17 XX 18 xxx 19 Xxxx 20 21 23 24 25 26 27 28 29 30 xxxX 32 2. Do problem 1 again using: 6, 10 and then 15 disks. The goal in all these is to invert the triangle using the fewest possible moves. Your answer MUST indicate each move you make and clearly show the total number of moves used. Seven friends play cards at a round table. To be a fair as possible, they decide that they will rearrange their seating order so that each person will have completely different neighbors in each of the 3 games. List each player and their neighbors for each of the 3 games 3