Analyze the running time of the following algorithms asymptotically. (a) Algorithm WhileLoop(n): x = 0; j = 1; while(j lessthanorequalto n){x = x + 1; j = 3j;} (b) Algorithm While Loop(n): x = 0; j = n; while(j greaterthanorequalto 2){x = x + 1; j = squareroot -j;} (c) Algorithm While Loop(n): x = 0 j = 1 while(j lessthanorequalto n) for i = j to n do x = x + 1 j = j + 1 return x