P

Please answer question 3 only

Problem 1 (10%) Write a program that prompts for and reads a double value rep-resenting a monetary amount. Then determine the fewest number of each bill and coin needed to represent that amount, starting with the highest (assume that a 100 z bill is the maximum size needed). Problem 2 (30%) Write a class that maintains the top ten scores for a game application, implementing the add and remove methods of Section 3.1.1 in the textbook, but using a singly linked list instead of an array. You need to implement the singly linked list yourself. Problem 3 (30%) Perform the previous project, but use a doubly linked list. Moreover, your implementation of remove(i) should make the fewest number of pointer hops to get to the game entry at index i. You need to implement the doubly linked list yourself