(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 0, and appropriately to receive full marks. Algorithm Ex1 ((a1,an),(b1,,bn)) k+0j1whilejndoIfaf==bnj+1k+k+1jj+1 return k=n [10 marks] (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)), such that n3 q true i1 while in2 and q== true do subTotal 0 forj0to2do subTotal subTotal +ai+j If subTotal ==0 q false ii+1 return