A program has two parameters, M and N. at the high level, the code looks like this: for counter in range(M): perform expensive computation1 for counter in range(N): perform expensive computation2 Big-O analysis of this code yields the following time complexity: O a. O(M) or O(N) O b. O(M*N) OC. O(M+N) O d. if M is bigger than N then O(N) else O(M) After the following statements, what are the values of both variables? x = 2013 y = x x= 13 O a. x is 2013 and y is 12 O b. x is 13 and y is 2013 O c. x is 2013 andy is 2013 O d. x is 13 and y is 13 cross out cross out cross out cross out cross out cross out cross out cross out