You are given an array A[1..n] of integers, n 1, and a value S. Write an algorithm using pseudocode that finds whether A contains a subarray with sum S. If yes, then return the indexes of the subarray. If no, then print a message. What is the Running Time of your algorithm?

Note: If A has multiple subarrays with sum S, then just return one of them.

Here are some examples:

if A = and S = 6, then the subarray has sum 6, so the algorithms returns the indexes of the subarray which are 2, 4.

if A = and S = 8, then the algorithm prints "no subarray with sum 8".