Write a code in java language.and also share output screen shot. Please $.$

a$-$write an algorithm for Merge$-$sort that uses queues. Your algorithm must use the queue ADT $($not the actual arrays, but must use the queues$).$ That is$,$ the input to the algorithm is a queue, and when partitioning is done, two queues are created $($L and G$).$ Then, L and G are sorted recursively in the same way and merged when sorted.

b$-$Implement your Merge$-$sort algorithm in Java programming language.

Note: without part a you can not proceed part b$.$ Part is an essential