list as input and calculates and returns the length (number of nodes) of the linked list. public static int calculateLinkedListLength(Node head) \{ // Your code here \} b) Implement a function that, when given reference to two sorted linked lists, returns a reference to the front of a new list containing all the nodes from the input lists sorted in ascending order. c) Write a recursive method to reverse a singly linked list. d) Write a method to find if a singly linked list contains a loop. e) Consider a doubly-linked list composed of nodes. Each node holds a character and two Node* variables, Next and Back. Additionally, there are Head and Tail pointers. Write a Java function to eliminate all instances of a character called 'Target' from the list. f) Write a method named contains that accepts two arrays of integers a1 and a2 as parameters and that returns a boolean value indicating whether or not a2 's sequence of elements appears in a1 (true for yes, false for no)