Whаt is the time cоmplexity оf the fоllowing code snippet? Assume the length of nums is n, аnd it is аlways greater than 5 elements long. def pair_sum(nums): total = 0 for i in range(len(nums)-2): for j in range(2, len(nums)): total += nums[i] * nums[j] return total