(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, 2 and 0 appropriately to receive full marks. Algorithm Ex2 ((a₁, ... an), (b₁, ..., bm)) qtrue for i 1 ton do jm while 1 and q == true do If a==bj 9-false jj-1 return q