Question 1: What is an algorithm? How will you analyse the time complexity of an algorithm? Question 2: Consider the following list of marks scored by students in their final examination. The maximum score for the exam is 40. Marks Array: 15 20 4 37 23 14 -7 17 Design an algorithm to find the highest mark scored in that examination from the Mark array. (BI) Analysing the asymptotic notation of the designed algorithm (CI) Rubric: Algorithm for biggest number in the array: 5 marks Time complexity to find biggest element in the array: 0.5 mark Question 3: In the real world, finding Greater Common Divisor (GCD) of two or more integers is the one of the application: In this task, find the GCD of the given numbers using Euclidean method: (GCD of 1220 and 516, apply the Euclidean Algorithm): Question 4: Analyze time complexity of given algorithmic code by showing it step by step. Note: 4 steps minimum Summation step Final time complexity for (X-1; XNX++) for (Y-1; Y