7. bool remove_alternate() deletes alternate nodes from the SinglyLinkedList. It should return true for a successful operation, and false for an unsuccessful operation. For example, Sample input Linkedlist:->10->15->20->25->30->35->40 remove_alternate(); Sample output Explanation Returns true 10 is not deleted, 15 is deleted, 20 is not Linkedlist:->10->20->30->40 deleted, 25 is deleted, 30 is not deleted, 35 is deleted, 40 is not deleted. Returns true 10 is not deleted, 20 is deleted, 30 is not Linkedlist:->10->30-> deleted, 40 is deleted. Linkedlist:->10->20->30->40-> remove_alternate(); 10 is not deleted, 30 is deleted. Returns true Linkedlist:->10-> Linkedlist:->10->30-> remove_alternate(); Linkedlist:->10-> remove_alternate(); Linkedlist:-> remove_alternate(); Returns false Linkedlist:->10-> There is only one item in SinglyLinkedList, so nothing is deleted. Returns false Linkedlist:-> SinglyLinked List is empty. So, nothing is deleted. Develop an algorithm for this oblem yourself and write the pseudocode. Now complete the method in the cpp file. Rigorously test your code with sample test cases. 8. bool remove_highest() deletes the node with the highest value from the SinglyLinkedlist. It should return true for a successful operation, and false for an unsuccessful operation. For example, Explanation Sample input Linkedlist:->60->75->30-> remove_highest(); Linkedlist:->60->30-> remove_highest(); Sample output Returns true Linkedlist:->60->30-> Returns true Linkedlist:->30-> Linkedlist:->30-> remove_highest(); Returns true Linkedlist:-> 30, which is the only value present, is the highest value. So, 30 is deleted. Linkedlist:-> remove_highest(); Returns false Linkedlist:-> SinglyLinkedList is empty. So, nothing is deleted. Develop an algorithm for this problem yourself and write the pseudocode. Now complete the method in the cpp file. Rigorously test your code with sample test cases