Using c++ searching and sorting and also dynamic allocation memory Your program will allow an employee at "Happy Pets" to enter the name of a pet that is brought into the office for treatment. Once...

Using c++ searching and sorting and also dynamic allocation memory Your program will allow an employee at "Happy Pets" to enter the name of a pet that is brought into the office for treatment. Once the pet name is entered, the program will use a search algorithm to check for the name in an array. If the name is found, the employee will receive a message that the pet is a returning customer. If the name is not found, the name will be added to a new array that has been dynamically allocated. Your program will:  Search an existing array to determine if the pet name is in the database  Sort an existing array (if needed)  Create a new dynamically allocated array to store the names of the new pets seen that are not in the existing array  Add the names of all of the new pets seen into a new array (the names will be stored in the dynamically allocated array).  Display the names of all of the animals in the existing array  Display the names of all of the animals in the new database  Allow the user to search for animal names or add new animal names repeatedly without exiting the program until they are done.  Don't forget to free the memory Use the following list of pet names to create the existing database/array of pets: { "King", "Skittles", "Smokey", "Sasha", "Pokey", "Fido", "Admiral", "Alexus", "Bambi", "Chance", "Dutchess", "Grizzly", "Howie", "Itsy", "Kane", "Lou", "Mugsby", "Oscar"};