Sorting a queue entered by the user by merg-sort

** Please answer this question using JAVA**

PLEASE implement the following algorithm to sort a queue by dividing it in half first and generate queue L and queue G, then use merge-sort to sort these two halves together.

Write a java code for Merge-sort that uses queues. Your code should implement a queue on the singly linked list, with the following operations: enqueue, dequeue, front, size, isEmpty. The input to the program is a queue entered by the user or generated randomly, and when partitioning is done (to divide the queue in half), two queues are created (L and G). Then, L and G are sorted recursively in the same way and merged when they are sorted.