Give the Big O performance of the following code fragment: for iin range(n): for j in range(n): k = 2 + 2 . Complete theimplementation of the code. That is, complete the five fragments'print() so e 1 answer