Design and analysis of algorithms

A. For the following code fragencsts and expressions, give the proper big O notation: B. Complete the table and determine the complexity of the algorithm Note: in your solution consider the condition alil ra hey is always false fi.e. the her does not exist in the arravl C. [2 marks] What does the given algorithm compute