(b) 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, and appropriately to receive full marks. Algorithm Ex2 ((a1, ... An), (b1, ..., bn)) a true for ir 1 to n do while j> 0 and q == true do If a; == b; q+ false j-j-1 return a