2. Missing Numbers You are given a list of n-1 integers and these integers are in the range of 1 ton There are no duplicates in the list. Two of the integers are missing in the list. Write an efficient code to find the missing integer. Return a tuple of the two missing numbers in ascending order. Constraints: You should be able to do this in O(n) where n > 2. 5