The following gives 5 lists of numbers in ascending order:

List #1: 1, 2, 6.

List #2: 5, 7, 10, 12.

List #3: 3, 4.

List #4: 8, 9, 11, 14, 15.

List #5: 13, 16, 18, 20.

The goal is to use a minimizing heap to merge these 5 lists to obtain a single list in ascending order. We discussed an algorithm of complexity n.log(k) for merging k ordered lists with a total of n elements using a heap. Use this algorithm to obtain the first 8 numbers of the ordered list. Start with the following heap formed by the smallest (the first) element from each list, i.e., 1, 5, 3, 8, 13: A(1) =1, A(2) =3, A(3) =5, A(4) =8, A(5) = 13.