Analyze the running time of the following algorithms asymptotically. (a) Algorithm for-loop(n): s leftarrow 0 for i leftarrow 1 to n do for j leftarrow i to n do s leftarrow s + i return s (b) Algorithm WhileLoopl(n): x leftarrow 0 j leftarrow n while (j greaterthanorequalto 1) for i leftarrow 1 to j do x leftarrow x + 1 j leftarrow j/3 return x (c) Algorithm WhileLoop2(n): X leftarrow 0 j leftarrow 2 while (j lessthanorequalto n) x leftarrow x + 1 j leftarrow j times j return x