asap please

(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 O, and @ appropriately to receive full marks. Algorithm Ex1 (aai, ... aann), (bb1, ..., bbmm) kk + nn x mm for ii + 1 tonn do for jj + 1 to mm do If adi 0