(a) Precisty spocify the conditons under which the folowing adgorthen retums (c) Preasely spocify the condations unser which the Golcwirg digoritten returie true, and then disouss, in detail, the funnirg sime of the wigorithm, If you tirk It has difforent best-and worst-case tunning times then these ahoudibe considered sepsrately, and you ahould explain the condicons under which best and worst-cases arioe. You must fully euplain your answor and use 0, and 0 appropilately to recolve hal marks. Algorithm Ext ((a1,ae)(b1,b4)) at hist dillerent best- and wost-cale runining tran then trewe showld be considered separably, and yeo should explan the condesions windar which best and work-cases arise. You must thly widein your intwor ard ise O,C. and 0 acpropiatey to recowim Mas mate: k+0j=1whilejndoIfaj=bhj+1kk+1lj+1 return k =mn Algoritm [x)(T,c) T is a balunoed birary sosech troe contaring ieteger namber values und ic is an Whegor. Each node in T has two chid nodes, emher a cumerc value or the viluis nalt bo insicale vele tack of a chald value. (b) Precisoby spenily the condifons under which the following digorithm returns true, and then discuss, in detail, the running time of the alporthrn. If you think. it has different best-and worst-case running times then these whould be considored soparatoly, and you sthould explain the condsions under which best and worst-casess ariso. You must fully oxplain your anawer and use 0,9 and e approprialely to receive ful marks Algorithm Ex2 ((ai,aa)), such that 3. q+truei+1whiletn2andqwatrardorubrotal0for1=0002dorubTotal=rubTotal+ai+1node-rose(t)whio(node=null)AnodevaluewaC.totumtrueeveifc