Provide an efficient and correct algorithm to solve the following problem. Problem: Subarray Sum Input: An array of integers Return Value: A non-empty list of CONTIGUOUS input values that sums to 0, or null if there are no such lists. If there are multiple lists that satisfy this condition, you may return any of them. Example: If the input is f8,-7,-3, -2, 5], the return value would be -3,-2, 5) Note: you can solve this in O(n log n) time