Questiastiriestttidtieess) Find the comhe ing of the following blocks of code or algorithm's description. [Note: your answer must show the steps that lead to your final answer] (2 marks each) 1) count...

Extracted text: Questiastiriestttidtieess) Find the comhe ing of the following blocks of code or algorithm's description. [Note: your answer must show the steps that lead to your final answer] (2 marks each) 1) count = 1 for i = 1 2) count = 0 for i = 1 to n do for k = 1 to n do for (j = 2;j< n="" do="" count="" +="j" j*="2;" end="" for="" end="" for="" end="" for="" end="" while="" 3)="" 4)="" the="" algorithm="" solves="" the="" problem="" of="" size="" n="" by="" dividing="" it="" into="" 8="" subproblems="" of="" size="" n/2,="" recursively="" solving="" each="" sub-="" problem,="" and="" then="" combining="" the="" solutions="" in="" 5)="" the="" algorithm="" solves="" the="" problem="" by="" breaking="" it="" into="" 4="" sub-problems="" of="" 1/2="" the="" scale,="" recursively="" solving="" each="" sub-maze,="" and="" then="" combining="" the="" solutions="" in="" linear="" time="" o(n³)="" time="" the="" algorithm="" solves="" the="" problem="" of="" size="" n="" by="" recursively="" solving="" two="" sub-problems="" of="" size="" n-="" 1,="" and="" then="" combining="" the="" solutions="" in="" constant="">