Provide the missing code segment in the portion with the TO DO remark in the following sample code. The Book class involved in the code is provided below: public class Book implements Comparable { protected int pages; public Book(){ pages = 1500; } public Book(int pages){ this.pages = pages; } public void setPages(int pages) { this.pages = pages; } public int getPages() { return pages; } public int compareTo(Book another) { // if same then return 0 if(this.pages == another.pages) return 0; //if current has more than return 1 else return -1 else if (this.pages > another.pages) return 1; else return -1; } }
Provide the missing code segment in the portion with the TO DO remark in the following sample code. The Book class involved in the code is provided below:
public class Book implements Comparable<Book> {
protected int pages;
public Book(){
pages = 1500;
}
public Book(int pages){
this.pages = pages;
}
public void setPages(int pages) {
this.pages = pages;
}
public int getPages() {
return pages;
}
public int compareTo(Book another) {
// if same then return 0
if(this.pages == another.pages)
return 0;
//if current has more than return 1 else return -1
else if (this.pages > another.pages)
return 1;
else
return -1;
}
}
![public class Dictionary extends Book implenents Comparator<Dictionary> {
private int numberofDefinedlords;
public Dictionary() {
super ();
numberOf DefinedWords = 52508;
public Dictionary(int pages, int definitions) {
super (pages);
numberof Definedwords = definiti ons;
public void setNumberof DefinedHords (int w) {
numberOf DefinedWords = u;
public int getNumberOfDefinedkords () {
return numberOfDefinedlords;
public double computeRatio() {
return numberof Definedwords / pages;
/**
* Return e if this dictionary has the same number of defined uords as another dictionary,
* -1 if this dictionary has iesser number of defined words as another dictionary and
* 1 if this dictionary has greater number of defined words as another dictionary.
*/
public int compare(Dictionary di, Dictionary d2) {
// TO DO (missing code segment 2)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F45fe4c57-b0e6-4485-95b7-0010badb1350%2Ff033602a-0099-40c7-8a53-8c3c714413a7%2F3mxvfcx_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)