Let M=2 , N=3, bb=1 and input index key =  c, l, d, h, h, d,…

Let M=2 , N=3, bb=1 and input index key =  c, l, d, h, h, d, e, k, a, e, g, d, l, l, e, c, h, k, b, f, d, h, g, d, b, b, h. Show the external sorting using merge-sort.                                                 A.) Create runs (3 points)                                                      B.) Show merge pass (7 points) (Please upload file to answer the question.)