describe in detail an algorithm for reversing singly linked list using only constant amount of additional space and not using any recursion - in the towers of hanoi puzzlewe are given platform with three pegsaband csticking out of it on peg is stack of diskseach larger than the nextso that the smallest is on the top and the largest is on the bottom the puzzle is to move all the disks from peg to peg cmoving one disk at timeso that we never place larger disk on top of smaller one see figure for an example of the case describe recursive algorithm for solving the towers of hanoi puzzle for arbitrary (hintconsider first the subproblem of moving all but the nth disk from peg to another peg using the third as "temporary storage figure puzzle an illustration of the towers of hanoi - describe recursive method for converting string of digits into the integer it represents for example" represents the integer , - describe recursive algorithm that counts the number of nodes in singly linked list -