I currently need help with this hw assignment. I am bit confused as to how complete this. By the way Comparable is just an interface.Thanks in advanced.

public class MergeSorter output1, QueueT output2)( //TODO 2 "Merges sorted input queues into an output queue in sorted order,and returns that queue. Use mergeHelper to accomplish this goal.@param input1 a sorted queue @param input2 a sorted queue @return a sorted queue consisting of all elements from input1 and input2 QueueT> mge(QueueTinput1, QueueT> input2) //TODO 3 return null; "Merges the sorted input queues into the output queue in sorted order.Implement this method recursively: In the base case, there's nothing left to do. Otherwise: Make progress on moving elements from an input to the output. Then make a recursive call to mergeHelper.@param inputl a sorted queue @param input2 a sorted queue @param outputa sorted queue containing the accumulated progress sofar void mergeHelper Queueinput1, QueueT>input2, QueueToutput)f //TODO 3