$2.(25$ points$)$ You are given an array A of integers and an integer k$.$ Design and write the pseudocode for a $\backslash (\backslash$theta$\backslash$left$($n$^\{2\}\backslash$right$)\backslash )($worst$-$case$)$ algorithm that finds a sequence of elements placed in consecutive indexes of the array whose sum is k$.$ Return the beginning index of the sequence. Return $-1$ if there is no such sequence in A such that their sum is equal to k $.$ Do a time complexity analysis on your algorithm.