Question 3 (20 marks) a) What is the name of the algorithm described in each of the following definitions? And is it complexity (6 marks; 2 marks each) 1) It is used for pattern matching, where a given pattern of size M and a string of size N. It skips unnecessary comparisons between the pattern and the string using a suffix-matrix and hence optimize the whole process. 2) It is used to search for a node in the graph by traversing from root node and explore the search as deep as possible until a dead end is found. 3) It is a greedy algorithm in graph theory that is used to find the tree with the lowest cost that connect all the nodes in a connected weighted graph. . US X3 B I E E yet b) Consider the following function: [6 marks] swered rked out of 0 def f(n) { if n == 0 return 1 else return (F(n-1) + Process(n)) Given that the complexity of Process(n) function is o(n) 1) Derive the number of arithmetic operation T(n) done by the function F(n) [2 marks] 2) Use the appropriate method to derive the complexity of the function F(n) 14 marks) 20