Question 4: Find the complexity of the following blocks of code or algorithm's description. [Note: your answer must show the steps that lead to your final answer] 1) count = 0 for i = 1 to n do for k...

hi can you help

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