In given list of n elements, write an algorithm to find three elements in an array whose sum is a given value. Try to do this problem using a brute force approach. Then try to apply the sorting approach along with a brute force approach. Time Complexity is O(n²)