Please solve the following question:

Please show your work in solving it and explain in more detail, and in clear writing. Thank You.

Short answer (5 points) Given the standard linked list below (assume head is pointing to node 8) 8 10 7 null Let's say "delete(6)" is called to attempt to delete a node with a data value of 6 from the list. In terms of the algorithm discussed in class and on the slides, answer the following: 1) Where will the "current" node be pointing when the delete function is finished? 2) Where will the "previous" node be pointing when the delete function is finished? 3) Where will the "head" node be pointing when the delete function is finished? Next, say "delete(7)" is called. Draw or describe what the linked list will look like after the function is finished and also indicate where the "current", "previous", and "head" node pointers will be