a laminated item consists of 5 layers. the thickness of the layers are independent and identically distributed

2) (15 pts) Write a function that returns the data of the kth element of a doubly linked list. If the number is negative, start looking from the end. If it is positive, then start looking from the head. NOTE: The function takes only an integer and a pointer to the head. There is no pointer to tail, class Doublyk int item; Doubly next; Doubly prev; For example, given the following data: Node 5 Node 4 Node 2 Node 1 (head) 10 Node 3 30 20 Example The 4th item is 40. The 4th item is 20 Precondition: The list will not be empty. The argument K will not be outside the list. K will not be 0. There is no tail. //Function header int getItem(int k, Doubly head) { //Code to deal with k when it is a positive number Code to deal with k if it is negative number W/Have to go all the way to the end and then start counting backwards If else