In general, algorithms are classified into paradigms like: greedy, dynamic, optimization, brute-force, and divide & conquer. Each of the following phrases describes one of these paradigm 1) A solution is obtained first and then search for the next optimum one and so on. 2) The optimum solution is found by examining all possible ones. 3) The solution is obtained by solving the sub-parts of the problem. Determine the paradigm for each description, and give an example of a famous algorithm that belongs to such paradigm. What is the complexity of the following tasks? 1) Finding the largest two elements in a queue of size n+3 using Nave search. 2) Remove the first item at the bottom of a stack data-structure of size n. 3) Inserting an item in a queue data-structure, this has already n elements. 4) Searching for a pattern of size K into a string of size T using KMP algorithm. 5) Searching for a pattern of size L into a string of size Y using Nave algorithm. 6) Computing the mathematical average of all items in a queue of size 2n. 7) Searching for an element on a sorted list of length M using Binary Search algorithm. 8) Traverse a graph of N nodes and E edges using Breadth First Search algorithm