Given an array of \(n\) integers, design an algorithm to determine whether any three of them sum to 0 . The order of growth of the running time of your program should be \(n^{2} \log n\). Extra credit: Develop a program that solves the problem in quadratic time.