The input file for this program is here: books.txt darr.

This is a text file that consists of individual entries describing $100$ books, in a modified format based on a popular book recommendation dataset $G.$

A single book entry consists of $5$ separate lines, each describing a characteristic, as described in this diagram.

Each book is described by $5$ lines in books.txt:

Read the file into an array or vector of these structures.

A good way to read an entire entry is to call getline$()5$ times $($notice that some fields can contain spaces$).$

Step $2$: Sorting the array

ISBN field of struct Book. All other fields can be ignored for the purposes of the sort. You can do the sort with a function or directly in main$().$

Complete the sort before prompting the user in the next step.

Step $3$: Prompt the user for a search key, search the array

Enter a loop and prompt the user to enter an ISBN number. Use this number as the key to search in the array $($or vector$).$

If the book is matching that ISBN is found, print all of the information from the struct, with a header identifying each field, like in the below example.

If the book was not found, print 'Not found' or a similar message.

Continuously loop for input until the user types a sentinel value such as a blank line or $-1.$

Other Notes

Here are the other requirements and notes:

Your $.$cpp file should have C$++$ implementations of binary search and bubble sort $($see examples$).$ Do not use any library functions for these.

No dynamic memory is needed for the array$/$vector storage. The input file contains $100$ books, it is OK to use a fixed$-$size array of $100$ structures $($or a vector$).$

The output should be formatted similar to the above example and easily readable $($do not print the entire book on one line without headers, etc.$).$

Use the input file as provided, no reformatting.

All of this program can be completed only with the syntax and topics we've covered so far in this class. Additional library functions or data types are not needed.

Example

Here is an example run for a successful and unsuccessful search. Your output does not need to exactly match, but it should be similar. Print each characteristic of the book on a separate line.