Algorithms and Time Complexity In algorithm development, the time and space required for algorithm completion is paramount. As users, we know that when a computer process takes too long, we try to avoid it. This truth encourages all IT and computer-based companies to produce faster products and services. For this assignment, write a one-to two-page paper that includes all required algorithms and pseudocode describing the time and space complexity of algorithms. Include the following: 1. Answer the following questions: o What is time complexity? o What is space complexity? 2. Compare and contrast polynomial time algorithms and nondeterministic polynomial (NP) time algorithms (one paragraph minimum). 3. Provide an example of an algorithm for each worst-case run times: o Oln). O ank. Note that this is called polynomial-time, wherek is any number greater than 1. o NP-time. Hint: Quick sort is an algorithm that runs in a nlog n) time. Review the Algorithms and Time Complexity Scoring Guide to understand how the assignment will be graded