You have been hired as a programmer at the local bank where you are dealing with records of customers registered at the bank. Your job is to locate the record number of the customers account that is associated with the bank. The records are all stored in the database as a 2D matrix. You have to write a program in C++ in such a way that you when given a particular number you return true if the record exists or return false when the record does not exist.

All the records are in an un-sorted order which means:

1. Sort the integers first row-wise (use bubble sort).

2. Search for the particular element. Your code must be optimal as the records being fetched must be fast. In order to maintain that it must never contain nested for or while loops. (hint: Use binary search)

************WE HAVE NOT LEARNED ABOUT stdio.h**********

Input Scenarios: Input 1: [10,16,14,20,21] [28,56,64,24,67] Element to be searched is: 70 Input 2: [2,6,10,8] [14,12,16,18] [23,25,24,27] 134,31,33,35)] Element to be searched is: 25 Input 3: [5,3,7,9,11] [13,16,18,21,20] Element to be searched is: 13