Use the Master Theorem (and the same notation from class for the Master Theorem) to answer the following questions. A merge sort algorithm that splits the input data into halves has the following recurrence, is in T(n)=2T(2n)+n A merge sort algorithm that splits the input data into p parts has the following recurrence, is in T(n)=pT(pn)+n (Note: in the answer options, ' '' denotes a superscript/exponentiation, while '_' denotes a subscript or logarithm base) [ Select ] O(n(log2(p))) O(nplgn) O(nlgn) O(np)