(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 0, 12 and appropriately to receive full marks. Algorithm Ex2 ((az, ... An), (b2, ..., bn)) a true for i 1 to n do jen while j >0 and q == true do If a == q+ false j-j - 1 return a [10 marks] Question continued over