Part 1. (10 points) Sorting algorithms Answer each of the parts in English (not code or pseudocode). Each subpart requires at most 2-4 sentences to answer. Answers significantly longer than required will not receive full credit (a) (3 points) Recall that merge sort works by taking an array, splitting it into two pieces, recursively sorting both pieces, then combining both pieces in O (n) time. Suppose we split the array into three equally sized pieces instead
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured