(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 ((aj, ... an), (b1, ...,br)) 9+ true for i = 1 to n do jen while j> 0 and a true do If a; == b; q=false 1-1-1 == return a