What is the worst case time complexity (in Big O) of the following algorithm? Show your work. Assume n is a power of 2. That is, n = 2^k, for some positive integer k. for (i = 1; i lessthanorequalto n; i ++) {j = n while (j greaterthanorequalto 1) {perform k basic operations j = |j/2|}}