PLEASE USING RECURSION, NO LOOPS AT ALL

Given an array inp arr$[]$ of non$-$negative integers and an integer sum,

find a contiguous subarray that adds to the given sum.

Note: There may be more than one subarray with the sum as the given sum;

print the first such subarray.

int inp$\_$arr$[10]=\{9,7,2,4,25,23,2,8,10,20\}$;

Example $1$: int target$\_$sum $=18$;$//$

Output: The target sum of $18$ can be found from start index: $0$ to the end index: $2$

Example $2$: int target$\_$sum $=10$;$//$

Output: The target sum of $10$ can be found from start index: $6$ to the end index: $7$

Example $3$: int target$\_$sum $=11$;$//$

Output: The target sum of $11$ can not be found.