Develop an algorithm for a given array that will find the all possible sub arrays with a sum less than some input value K. Strictly speaking a sub array can contain only 1 element, but were interested in sub arrays of more than one element. E.g. given an array {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} and an input K =6, sub arrays {1,2}, {2,3} are both less than 6. If K = 7 {1,2,3} now becomes a valid sub array as well. You can write a program for this or just describe the algorithm