Suppose you are given a set P of integers and another integer x. We wish to use a T(n2)algorithm to decide whether there are 3 integers in P and the sum of these three integers equals to x. Show your algorithm and indicate why its complexity is T(n2). (You can use pseudo code or by illustration only)