Programming question warm up. To enable you to solve the programming ques- tion answer the following question first. It will not be graded but will make coding much easier. Consider an ADT consisting of a set S of distinct integers and the following operations: INSERT(S,x): Insert the element r into the set S. This operation has no effect if r is already in S. DELETE(S,x): Delete the element x from the set S. This operation has no effect if x is not in S. QUERY(S,x): Return true if x is in S and return false if x is not in S. CLOSEST-PAIR(S): Return two integers in S which are closest together in value. In other words, if CLOSEST-PAIR(S) returns the integers a and b, then they must satisfy the condition VxVy(x + y + la 61