Algorithm and Sorting, Big-O

1) An algorithm to sort and list names has been made out of two other algorithms. The first algorithm will sort the names and is order O(n * log2 n). The second algorithm lists the names and is order O(n). The entire sort-and-list algorithm is therefore of order: a) O(n). b) O(n * log2 n). c) O(n^2 * log2n^2). d) none of the above. Explain Why. 2) The approximate number of iterations of an algorithm with data size N is determined to be: 1 + 2 + 3 + ... + N a) Write a table that shows N and the number of iterations for the first 10 values of N. b) What is the O-notation for this algorithm? ## Deliverables 1) Text file solution to these problems. ## Platform N/A