Problem Three: (10 points. 5 points each)

1. Write a insertAfter algorithm for double linked list
2. Write a remove algorithm for double linked list

Problem Four: (10 points. 5 points each) In your textbook, the search algorithm returns the node reference that refers to the first node whose data match the search target. Write search algorithm to return the node reference that refers to the last node whose data match the search target. Assume your algorithm input is

1. A single linked list and target data
2. A double linked list and target data

Problem Four: (20 points. 10points each)

1. Implement Queue ADT using two stacks
2. Implement Stack ADT using two queues