[30%] Tight bound on Time complexity. For the following pieces of code, give the tightest theta() estimate that you can, and Show all the working A int total = 0: for (int i = 0; i 0; i = i/2){total = total 4-1;}