C$++$: Modify the above binary search algorithm $($without vectors or algoritm$)$ to instead find the first occurrence of the item $($i$.$e$.$ if the item is indeed in the array$).$ Write a main function to test it as follows.

Sample input and corresponding output:

Enter the number of elements that you want in the array: $6$

Enter the elements: $982738536838$

The sorted array is $273838536898$

Enter the element that you are searching for: $38$

The index of the first occurrence of $38$ is $1.$

Thank you!

Enter the number of elements that you want in the array: $6$

Enter the elements: $982738536838$

The sorted array is $273838536898$

Enter the element that you are searching for: $7$

The element $7$ does not exist in the array.

Thank you!