Analyze the running time of the following algorithms asymptotically. (a) Algorithm for-loop1(n): P = 1 for i = 1 to 4n do p=p times i return p (b) Algorithmfor-loop2[n]: s = 0 for i = 1 to n do for j = i to n do s = s + i return 5 (c) Algorithm WhileLoop1[n]: x-0; j = 1; while (j^3