[Category: Optional] We have discussed the 3-Sum problem in class, given an integer array, three that sum to 0. Now we have slightly different version of the question. Given the same array, find the number of triplets whose sum is less than a target.