14. (Exhaustive search /optimization) The 3-product problem is: Input: an array S of n integers and a target integer T Output: three elements x, y, z from S such that x*yzT or None if no such elements exist For example, given array S-(3,2,5,1, 8], and target T-15, a correct output is x-3, y-5, 1. If T-20 for the same S, the output is None. a) Which pattern is most appropriate for this problem? Justify why? Circle
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured