ased on the given adjacency lists and the figure below for the graph search, which of the following statements are correct? (Select all that applies.) adj(s) = [a, c, d], adj(a) = [ ], adj(c) = [e, b], adj(b) = [d], adj(d) = [c], adj(e) = [s]. see the picture sent  Group of answer choices Breadth-First Search: s a c d e b Breadth-First Search: s a c d b e Depth-First Search: s a c b d e Depth-First Search: s a c e b d

Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1 >2->3->4->5->6 then the output should be 4. Make the following adjustments to the class HWLinkedList  code below Add the method addAtHead to the class below. The method should simply add a new element to the beginning of the linked list instead of the end. Add the method searchList to the class below. The method should return true if the user specified object is found and false otherwise. The method must be recursive. Add the remove method   public class HWLinkedList<E> { private class Node<E> { private E data; Node<E> next; public Node(E data) { this.data = data; this.next = null; } } private Node<E> head; public HWLinkedList() { this.head…

can I have the solution for this question in Java coding please? Write an algorithm for the following to swap two adjacent elements by adjusting only the links (and not the data) using: Singly-linked lists. Doubly linked lists.