The Java heapSort() method's first loop heapifies the list. One loop iteration occurs for each node with only 1 child node O leaf node internal node

To calculate the number of nodes in a circularly linked list with a head node that represents a list of positive integers, write a pseudo-code process. The head node stores the number of nodes as a negative number.

Java language NOTE THAT WE ARE USING **LINKED LISTS** SEE PICTURES FOR ALL INFORMATION Solve method public boolean inSort(double elt) { //code goes here } please and thank you!!!!

Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 2.) Define SLinkedList Classa. Instance Variables:     # Node head     # Node tail     # int sizeb. Constructorc. Methods     # int getSize() //Return the number of nodes of the list.     # boolean isEmpty() //Return true if the list is empty, and false otherwise.     # int getFirst() //Return the value of the first node of the list.     # int getLast()/ /Return the value of the Last node of the list.     # Node getHead()/ /Return the head     # setHead(Node h)//Set the head     # Node getTail()/ /Return the tail     # setTail(Node t)//Set the tail     # addFirst(E e) //add a new element to the front of the list     # addLast(E e) // add new element to the end of the list     # E removeFirst()//Return the value of the first node of the list     # display()/ /print out values of all the nodes of the list     # Node search(E key)//check if a given…