no algorithms needed...its the explanation

Question 3 (25 Marks) a) Using graphs or diagrams explain the meaning of best case, worst case and average case time complexity How could each of the above be used to compare the complexity of a range of given algorithms. (5 Marks) b) Give an example of a classical search algorithm. Evaluate its complexity and hence compare and contrast your chosen search algorithm to Grover's search algorithm. Include in your discussion, references for each of the algorithms presented, an outline of the steps taken by each algorithm, clarification regarding similarities and differences in the methodology employed by each and an account of the complexity of each. (10 Marks) c) Investigate the claim that 7n - 71n - 4 = 0(n) (10 Marks) Question 3 (25 Marks) a) Using graphs or diagrams explain the meaning of best case, worst case and average case time complexity How could each of the above be used to compare the complexity of a range of given algorithms. (5 Marks) b) Give an example of a classical search algorithm. Evaluate its complexity and hence compare and contrast your chosen search algorithm to Grover's search algorithm. Include in your discussion, references for each of the algorithms presented, an outline of the steps taken by each algorithm, clarification regarding similarities and differences in the methodology employed by each and an account of the complexity of each. (10 Marks) c) Investigate the claim that 7n - 71n - 4 = 0(n) (10 Marks)