Design and write a binary search function that searches for a value in a sorted integer array of size $100.$

Write a main function that generates an array of $100$ integers in the counting order from $50$ up $($the array should store numbers $50,51,52,53,...,$ etc. in the ascending order$),$ invokes the binary search function for value $67,$ and then invokes the binary search function for value $245,$ display the search results: if the number is found, display the index of the value in the array; if the number is not found, display "value not found".