(1 pt each) Questions 11-15. 11. What is the (best) asymptotic lower bound on sorting n items distributed one per processor on a mesh of size n?Why (a brief explanation in the space provided)? 12. What is the (best) asymptotic lower bound on sorting n items distributed one per processor on a hypercube of size n? Why (a brief explanation in the space provided)? 13. Given an array with n data items, what is the optimal asymptotic running time of parallel prefix on a sequential computer? Briefly describe your algorithm below. 14. Given n data items, distributed one per processor on a mesh of size n, what is the asymptotic running time of an optimal parallel prefix algorithm? 15. Given one piece of data per processor on a linear array of size n, what is the asymptotic running time of an optimal sorting algorithm