Problem 5 Part a Write the pseudocode for a function which takes a sorted linked list (sorted in non-decreasing order) and deletes any duplicate nodes. The linked list should only tbe traversed once. The function takes 1 Part b Show how your code works on the following linked list: 5->5->6- >8- >10->10- >13- >15-15