in c$++$ recall binary search from lecture. Using the code for that function as a starting point, implement the following function:

bool findAnl$($int nums I, int length, int target, int &firstindex, int Alastindexis

The function tokes a sorted arroy nums $($sorted in ascending order$)$ and returns true if the target is found and false otherwise. Also, if the target is found, the function sets firstindex and lostlndex to the incexes of the first and last occurrences, respectively. Wotice thot firstindex and lastindex are reference parameters, so the cain function as de facto retum volues to the colles$)$

Bxample: If the torget $=3$ and gyms $($of length $5)$ contains the values $\{8,3,3,7,9$