11. What is the big-time complexity of each of the following snippets of code? Do not include any lower-order terms. 1 For i from 1 to N: 2 Print (i) 1 For i from 1 to N: For j from 1 to M: Print (i + j) OCNS) 1 i - 1 2 sum = 0 3 While i 0: Print (j) j - j - 1 i = i + 1 1 i - N 2 sum - 0 3 While 1 > 1 : 4 Sum - sum + 1 5 1-1/2 # truncate