Code the Following: A. Implement sort Use Java to implement and test one of the sorting algorithms below. not a Java library method. and document code. 1. merge sort 4 . bubble sort 2. selection sort 5. insertion sort 3. Quicksort B. Declare a class for a linked-list, and for a list node, as specified below, including constructors. 1. a linked list of floats. Include necessary class declarations and method definitions to implement insertion of one value and display of all values. 2. a linked list of integers, representing page numbers in a book index. To represent index entries, create an array of objects, each consisting of a string (the word entry) and a linked list of pages. 3. a (possibly very large) decimal number, represented as a linked list of digits 4. a paragraph, implemented as a linked list of strings 5. a doubly-linked list of floating-point numbers Write Java code (do not use Java libraries) to perform the following on a linked list of integers: 6. prepend a new value 7. Option: Implement the bag ADT as a linked list of objects consisting of a data item and a key