Write a program to create a stack of books where each Book will contain the following attribut

BookISBN

BookName

Authors

a$.$ Create a method to insert a new book into the stack and a method to display the details of a books in the stack.

b$.$ Can we use another data structure to store the list of books? If yes, Justify your answer.

Write steps to check whether the given tree is a Binary Search tree or not?

Explain the up$-$heap bubbling technique with the help of an example.

$[[$java$]]$