(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 O, 2 and appropriately to receive full marks. Algorithm Ex1 ((aj,... an), (b1, ...,bm)) 1 KO for i = 1 to n do 1+1 while j 0