6. The worst cane situation of the Bubble sort algorithm is when the input array is a. Unsorted datal b. Nearly sorted data Inverted data d. Random data C. 7. Which of the following statements is false about an Iterator/ListIterator class in Java: a. An Iterator object can traverse in both directions. b. Using an Iterator object, an element cannot be added/replaced but can only be removed. c. A Litlterator object can only be defined for Arrastiat or LinkedList object. d. The basNext() method returns a Boolean value. 8. A node in a single-linked list has the following parameters: 2. A data and a reference to the next node. b. A data and a reference to the previous node. c. A data and references to the previous node and the next node. d. References to the first node. 9. If an application needs frequent insertion/deletion operation, which of the following data structure needs to be preferred: a. Arrays. b. Arrastiat c. LinkedList. d. Both (b) and (c). 10. For the given sample of code the processing time increases in proportion to the number of inputs n, the algorithm grows at arate public static int search (intl) x, int target) { for(int i=0; i