Subject : Data StructureLanguage : CTopic : Hash TableSub Topic :- Pop- Push- SearchCase :Bluejack Library is one of the popular libraries in the town. This library has more than 50.000 books. Sadly the senior librarian wants to resign and he doesn’t have time to teach the new librarian. Bluejack Library needs a simple program to help the new librarian so he can easily manage and search books. Bluejack Library hires you as a programmer to help them create a program that can help a new librarian find and manage books in this library easily using a C programming language and hashtable data structure. The criteria of the program are:The program consists of 4 menus, there are:View BookInsert BookRemove BookExitIf the user chooses View Book (Menu 1), then:* If there is no book, then show “There is no book(s) !” message* Otherwise, the program will show all the book dataIf the user chooses Insert Book (Menu 2), then:- The program will ask user to input the following data:* Book Title* Validate Book Title must be between 5 and 50 characters* Validate Book Title must be unique* Book Author* Validate Book Author must start with “ “ or “Mrs. “ and its length must be between 3 and 25 characters* ISBN* Validate ISBN must be numeric and its length must be between 10 and 13 digits* Page Number* Validate Page Number must be at least 16- After that, the program will generate a unique id for the inputted book data. The format will follow the following formula:[Book ID] : [BXXXXX]-[ISBN]-[A][T] X: The last inserted Book Id number increased by 1 A: The first character of Book Author in uppercase format T: The first character of Book Title in uppercase formatFor example:The last inserted Book Id is B00001-0123423123-JHThen the newly inserted Book Id will be B00002-……- Then, the program will store the inputted new book data to the next item of the last item of the chaining hash table with size 1007 using the following hash functionKey = SUM % SIZEKey : the hash table index that will store the dataSUM : The sum of the ascii from Book IdSIZE : The size of the hash table (1007)Example:Book Id : B00001-0123423123-JHSUM : 1044Size : 1007Key : 1044 % 1007 = 37Then the book data will be stored at index 37 of hash tableIf user chooses Remove Book (Menu 3), then:- The program will ask user to input a Book ID* Validate if the inputted Book ID doesn’t exists then show “Book not found”* Otherwise, show the book data and ask the user for confirmation. Validate input must be either “y” or “n”- If user chooses “y”, then delete the data- Otherwise, if user chooses “n” return back to main menuIf user chooses Exit (Menu 4), then terminate the program Book TitleInput book title[5-50][unique]: Don't Make Me ThinkThe book title is already exists !Input book title[5-50][unique]: Agile Project Management With ScrumInput author name[3-25][Mr. IMrs. ]: Ken SchwaberInput author name[3-25][Mr. İMrs. j: Mr. Ken SchwaberInput ISBN[10-13][numeric]: test123123Input ISBN[10-13][numeric]: 9780735619937Input page number[- 16]: 15Input page number[- 16]: 192• Validate Book Title must be between 5 and 50 characters• Validate Book Title must be uniqueBook Author• Validate Book Author must start with “Mr. “ or “Mrs. “ and its length must bebetween 3 and 25 charactersInsert success !ISBNFigure 4. Insert Menu• Validate ISBN must be numeric and its length must be between 10 and 13 digitsPage NumberIf user chooses Remove Book (Menu 3), then:• Validate Page Number must be at least 16 The program will ask user to input a Book ID After that, the program will generate a unique id for the inputted book data. The formatValidate if the inputted Book ID doesn't exists then show "Book not found"will follow the following formula:Input book id to delete: Be0001-0123423123-JH[Book ID] : [BXXXXX]-[ISBN]-[A][T]X: The last inserted Book Id number increased by 1Book not found !Figure 5. The Inputted Book ID Doesn't ExistsA: The first character of Book Author in uppercase formatOtherwise, show the book data and ask the user for confirmation. Validate input mustT: The first character of Book Title in uppercase formatbe either "y" or "n"For example: If user chooses "y", then delete the dataThe last inserted Book Id is B00001-0123423123-JH Otherwise, if user chooses “n" return back to main menuThen the newly inserted Book Id will be B00002-..Input book id to delete: BO0002-9780735619937-AM Then, the program will store the inputted new book data to the next item of the last itemBook Id: B00002-9780735619937-AMBook Title: Agile Project Management With ScrumBook Author: Mr. Ken SchwaberBook ISBN: 9780735619937Page Number: 192Are you sure [yln]? YAre you sure (yln]? yof the chaining hash table with size 1007 using the following hash functionKey = SUM % SIZEKey : the hash table index that will store the dataSUM : The sum of the ascii from Book IdSIZE : The size of the hash table (1007)Delete success !Figure 6. Confirmation To DeleteExample:Book IdB00001-0123423123-JH: 1044: 10071044 % 1007 = 37SUMIf user chooses Exit (Menu 4), then terminate the programSizeKeyThen the book data will be stored at index 37 of hash tableTVT C Bluejack LibraryBluejack Library is one of the popular libraries in the town. This library has more than 50.000books. Sadly the senior librarian wants to resign and he doesn't have time to teach the new librarian.Bluejack Library needs a simple program to help the new librarian so he can easily manage and searchbooks. Bluejack Library hires you as a programmer to help them create a program that can help a newlibrarian find and manage books in this library easily using a C programming language and hashtabledata structure. The criteria of the program are:• The program consists of 4 menus, there are:1. View Book2. Insert Book3. Remove Book4. ExitBluejack Library1. View Book2. Insert Book3. Remove Book4. ExitFigure 1. Main Menu• If the user chooses View Book (Menu 1), then: If there is no book, then show "There is no book(s) !" messageThere is no book(s) !Press Enter to continue ...Figure 2. There is No Book Message(View) Otherwise, the program will show all the book dataBook I0I Book Title| Book AuthorI ISSN| Page Numberbee1-9780321344755-ON | Don't Hake He Think| Mr. Krug S.| 9780321344755 | 186Do0002-9780735619937-A | Agile Profject Ranagonent Mieh Scrun| Mr. Ken Schwaber| 9780735619937 | 192Press Enter to continueFigure 3. Show All Book DataIf the user chooses Insert Book (Menu 2), then: The program will ask user to input the following data:

Question

Subject : Data StructureLanguage : CTopic : Hash TableSub Topic :- Pop- Push- SearchCase :Bluejack Library is one of the popular libraries in the town. This library has more than 50.000 books. Sadly the senior librarian wants to resign and he doesn’t have time to teach the new librarian. Bluejack Library needs a simple program to help the new librarian so he can easily manage and search books. Bluejack Library hires you as a programmer to help them create a program that can help a new librarian find and manage books in this library easily using a C programming language and hashtable data structure. The criteria of the program are:The program consists of 4 menus, there are:View BookInsert BookRemove BookExitIf the user chooses View Book (Menu 1), then:* If there is no book, then show “There is no book(s) !” message* Otherwise, the program will show all the book dataIf the user chooses Insert Book (Menu 2), then:- The program will ask user to input the following data:* Book Title* Validate Book Title must be between 5 and 50 characters* Validate Book Title must be unique* Book Author* Validate Book Author must start with “ “ or “Mrs. “ and its length must be between 3 and 25 characters* ISBN* Validate ISBN must be numeric and its length must be between 10 and 13 digits* Page Number* Validate Page Number must be at least 16- After that, the program will generate a unique id for the inputted book data. The format will follow the following formula:[Book ID] : [BXXXXX]-[ISBN]-[A][T]                                        X: The last inserted Book Id number increased by 1                                        A: The first character of Book Author in uppercase format                                        T: The first character of Book Title in uppercase formatFor example:The last inserted Book Id is B00001-0123423123-JHThen the newly inserted Book Id will be B00002-……- Then, the program will store the inputted new book data to the next item of the last item of the chaining hash table with size 1007 using the following hash functionKey = SUM % SIZEKey     : the hash table index that will store the dataSUM   : The sum of the ascii from Book IdSIZE    : The size of the hash table (1007)Example:Book Id           : B00001-0123423123-JHSUM               : 1044Size                 : 1007Key                 : 1044 % 1007 = 37Then the book data will be stored at index 37 of hash tableIf user chooses Remove Book (Menu 3), then:- The program will ask user to input a Book ID* Validate if the inputted Book ID doesn’t exists then show “Book not found”* Otherwise, show the book data and ask the user for confirmation. Validate input must be either “y” or “n”- If user chooses “y”, then delete the data- Otherwise, if user chooses “n” return back to main menuIf user chooses Exit (Menu 4), then terminate the program Book TitleInput book title[5-50][unique]: Don't Make Me ThinkThe book title is already exists !Input book title[5-50][unique]: Agile Project Management With ScrumInput author name[3-25][Mr. IMrs. ]: Ken SchwaberInput author name[3-25][Mr. İMrs. j: Mr. Ken SchwaberInput ISBN[10-13][numeric]: test123123Input ISBN[10-13][numeric]: 9780735619937Input page number[>- 16]: 15Input page number[>- 16]: 192• Validate Book Title must be between 5 and 50 characters• Validate Book Title must be uniqueBook Author• Validate Book Author must start with “Mr. “ or “Mrs. “ and its length must bebetween 3 and 25 charactersInsert success !ISBNFigure 4. Insert Menu• Validate ISBN must be numeric and its length must be between 10 and 13 digitsPage NumberIf user chooses Remove Book (Menu 3), then:• Validate Page Number must be at least 16> The program will ask user to input a Book ID> After that, the program will generate a unique id for the inputted book data. The formatValidate if the inputted Book ID doesn't exists then show &#34;Book not found&#34;will follow the following formula:Input book id to delete: Be0001-0123423123-JH[Book ID] : [BXXXXX]-[ISBN]-[A][T]X: The last inserted Book Id number increased by 1Book not found !Figure 5. The Inputted Book ID Doesn't ExistsA: The first character of Book Author in uppercase formatOtherwise, show the book data and ask the user for confirmation. Validate input mustT: The first character of Book Title in uppercase formatbe either &#34;y&#34; or &#34;n&#34;For example:> If user chooses &#34;y&#34;, then delete the dataThe last inserted Book Id is B00001-0123423123-JH> Otherwise, if user chooses “n&#34; return back to main menuThen the newly inserted Book Id will be B00002-..Input book id to delete: BO0002-9780735619937-AM> Then, the program will store the inputted new book data to the next item of the last itemBook Id: B00002-9780735619937-AMBook Title: Agile Project Management With ScrumBook Author: Mr. Ken SchwaberBook ISBN: 9780735619937Page Number: 192Are you sure [yln]? YAre you sure (yln]? yof the chaining hash table with size 1007 using the following hash functionKey = SUM % SIZEKey : the hash table index that will store the dataSUM : The sum of the ascii from Book IdSIZE : The size of the hash table (1007)Delete success !Figure 6. Confirmation To DeleteExample:Book IdB00001-0123423123-JH: 1044: 10071044 % 1007 = 37SUMIf user chooses Exit (Menu 4), then terminate the programSizeKeyThen the book data will be stored at index 37 of hash tableTVT C Bluejack LibraryBluejack Library is one of the popular libraries in the town. This library has more than 50.000books. Sadly the senior librarian wants to resign and he doesn't have time to teach the new librarian.Bluejack Library needs a simple program to help the new librarian so he can easily manage and searchbooks. Bluejack Library hires you as a programmer to help them create a program that can help a newlibrarian find and manage books in this library easily using a C programming language and hashtabledata structure. The criteria of the program are:• The program consists of 4 menus, there are:1. View Book2. Insert Book3. Remove Book4. ExitBluejack Library1. View Book2. Insert Book3. Remove Book4. Exit>>Figure 1. Main Menu• If the user chooses View Book (Menu 1), then:> If there is no book, then show &#34;There is no book(s) !&#34; messageThere is no book(s) !Press Enter to continue ...Figure 2. There is No Book Message(View)> Otherwise, the program will show all the book dataBook I0I Book Title| Book AuthorI ISSN| Page Numberbee1-9780321344755-ON | Don't Hake He Think| Mr. Krug S.| 9780321344755 | 186Do0002-9780735619937-A | Agile Profject Ranagonent Mieh Scrun| Mr. Ken Schwaber| 9780735619937 | 192Press Enter to continueFigure 3. Show All Book DataIf the user chooses Insert Book (Menu 2), then:> The program will ask user to input the following data:

Accepted Answer

Blue jack library management using c language
Make the necessary changes if you want