Examine the following C++ program and give its output. (1 mark). #include #include #include using namespace std; void search vector & vec, int val) { } cout < < "searching for " < < val < < " ... "; if (binary_search (vec.begin(), vec.end(), val)) cout < < "found! "; else cout < < "not found. "; int main() { vector primes = { 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, }; search primes, 87 ); search primes, 97 ); } (b) Explain in detail the signature of the binary_search algorithm. (3 marks) template bool binary_search( Iterator first, Iterator last, const T& val); A