code

Blackboard Remaining Time: 57 minutes, 58 seconds. Question Completion Status: Assume that class Node and class SinglyLinkedList for lists of integers contains the methods which are summarized in the table below. Extend class SinglyLinkedList by writing a method, removeAllOccurrencesof Smallest, that finds and deletes all the occurrences of the smallest element in the list. class Node int getInfo() Returns the value of info of the node. int getLink() Returns the reference of the next node. class SinglyLinkedList void addFirst (int info) Inserts the specified element at the beginning of this list. boolean contains (int info) Returns true if this list contains the specified element int getFirst() Returns the first element in this list. boolean isEmpty() Returns true if this list is empty. int remove(int info) Removes the first occurrence of the element in this list. int size() Returns the number of elements in this list MacBook Pro 88a A 6 2 3 4 % 5 E E 7 W E R T Y 60: E E S D F G y V B . 1 & 3 command L A Moving to another question will save this response. Question 4 of 6 Question 4 3 points Save Answer Write a recusive method, called sequence(), which prints a sequence of numbers, separated by a white space, starting from the number n, which is given as a parameter to the method. Then, the next element ni of the sequence is (ni-1/2) if ni is even, otherwise, it is (3 * ni-1 + 1). The sequence ends with 1. void sequence(int n) { Example: sequence(20) will print: 20 10 5 16 8 4 2 1 sequence(3) will print: 3 10 5 16 8 4 2 1 For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). B 1 US Paragraph Arial TX 14px 86 O WORDS POWE MacBook Pro