Write a java method called "containsCycle" that receives the head of a singly linked list and returns true if the linked list contains a cycle and returns false otherwise. A linked list contains cycles if the next reference of any node refers to a preceding node. For example the linked list contains a cycle: Head 01 02 03 04 05 1 08 314 07 06 Given the following array: 67, 78, 122, 15, 12, 17, 312, 11, 10, 222, 18, 19, 121 What will be the array contents looking like in the following situations: 1) after calling the partition method three times in quick sort if pivot is the last element. 2) after the third iteration of the outer loop in insertion sort. 3) in bucket sort, after the array is put into buckets and the sort buckets loop starts show how array elements are organized in buckets after the third iteration of the loop that sorts buckets if this loop sorts buckets using selection sort