Can you pleasee do these problems in c++ programming language. I really need your help, it is urgent. Thank you in advance. Eternally grateful

1. Write a program that will: a) allow the input of 100 integers and store them in an array A, and following that, b) allow the input of any number of integers.For each integer, your program should output the number of times the given integer occurs in the array (for the elements that do not exist in the array, output 0.) This functionality does not have to (but also can be) embedded in a function.

2. Write down the recursive version of binary search, that returns true if the element is present or false if the element is not present. As a hint, here is the signature of the function we are looking for:bool binarySearch(int A[], int l, intr, int x), where A is the array, l and r are the current left and right borders of the array, and x is the number we are looking for.