Merge sort algorithm is about to complete the sort and is at the point just before the last merge. At this point, elements in each half of the array are sorted amongst themselves. Illustrate the above...

1. Merge sort algorithm is about to complete the sort and is at the point just before the last merge. At this point, elements in each half of the array are sorted amongst themselves.

Illustrate the above statement by looking at the array of the following ten integers:
5 3 8 9 1 7 0 2 6 4
and drawing the array before the final merge sort is completed (sorting from Smallest to largest)

2.Consider a polynomial that can be represented as a node which will be of fixed size having 3 fields which represent the coefficient and exponent of a term plus a pointer to the next term or to 0 if it’s the last term in the polynomial.

Then A = 11x⁴
  -2x  is represented by fig below

Represent the following polynomials in linked list form

1. P = G – 3L +2F