Improve the complexity of the program code in this link: https://anotepad.com/notes/2hp26qqd. Use hash table as an example, consider the following list. 

LO 5 I 1 D Position in List 713 1 2 3 4 17 In this approach, create a hash table whose entries are < position of node, node address >. That means, key is the position of the node in the list and value is the address of that code. 4 Address of Node Address of 5 node Address of 1 node Address of 17 node Address of 4 node NULL By the time we traverse the complete list (for creating the hash table), we can find the list length. Let us say the list length is M. To find nth from the end of linked list, we can convert this to M - n +1th from the beginning. Since we already know the length of the list, it is just a matter of returning M - n + 1th key value from the hash table.