Problem 1: Write a function deleteAtIndex that takes a linked list head and an integer index as an argument, looks for the node in the linked list at index index and delete the node from the linked list (disconnect it from the list). Assumptions: .Usrs always gives a valid index. User will never delete the head/first node in the list. (i.e: the user will never enter index-0) The linked list will have at least two elements Example: Given linked list [1,2,3], which looks like the following: 1 2 3 Input: index 1 Output: List After Deletion: 1 3