1. (a) Precisely specify the conditions under which the following algorithm returns true, and then discuss, in detail, the running time of the algorithm. If you think it has different best- and worst-case running times then these should be considered separately, and you should explain the conditions under which best- and worst-cases arise. You must fully explain your answer and use 0, 12 and appropriately to receive full marks. Algorithm Ex1 ((an, ... An), (b1, ...,bm)) ko for ir 1 to n do j+1 while j 0 [10 marks]