Suppose you are given an m sorted list, each containing n elements.

$[10$ Marks$]$

Write an efficient algorithm based on priority queue to sort them in increasing order

Example: $$

Input: $5$ sorted lists of fixed size $4$

$11,21,31,41$

$16,26,36,46$

$28,30,38,49$

$33,34,40,51$

$17,19,23,29$

Output: $$

$11,16,17,19,21,23,26,28,29,30,31,33,34,36,38,40,41,46,49,51$