Write a java method that receives the heads of two singly linked lists and checks whether each of them is the reverse of the other or not.

Assume that the linked list class is ready and called (MyLinkedList) that contains nodes with int data, and next reference. Assume also that the following methods are available on hand: addFirst(), addLast(), addAtIndex(), removeFirst(), removeLast(), removeAtIndex(), size().

Note: You are free to use any data structure (queue, stack, set, map, tree) in your solution