Consider the following pre-existing linked list(s) in a 32K deep memory.
Design a module that takes in a head pointer (starting address) of a linked list and inverses it. Once done, it asserts a done signal with the new head pointer, which was earlier the tail pointer.






