$2\mathrm{.}7$ LAB: Library book sorting

Two sorted lists have been created, one implemented using a linked list $($LinkedListLibrary linkedListLibrary$)$ and the othe implemented using the built$-$in ArrayList class $($ArrayListLibrary arrayListLibrary$).$ Each list contains $100$ books $($title$,$ ISBN number, author$),$ sorted in ascending order by ISBN number.

Complete main$()$ by inserting a new book into each list using the respective LinkedListLibrary and ArrayListLibrary insertSorted$()$ methods and outputting the number of operations the computer must perform to insert the new book. Each insertSorted returns the number of operations the computer performs.

Ex: If the input is:

The Catcher in the Rye

$9787543321724$

J$.$D$.$ Salinger

the output is:

Number of linked list operations: $1$

Number of ArrayList operations: $1$

Which list do you think will require the most operations? Why?

$546390\mathrm{.}1983010$ qx$3$zqy$?$

LAB

ACTIVITY

$2\mathrm{.}7\mathrm{.}1$: LAB: Library book sorting

$\frac{0}{10}$

Current file: Library.java

Load default template...

$1$ import java.util.Scanner;

import java.io$.$FileInputStream;

import

java.io$.$ IOException;