In the Card1 class, the compareTo() method orders cards by first comparing the card’s suitsand then ranks if needed (when there is a tie). The suits and ranks are ordered as follows:suits: The suits will be ordereddiamonds © < clubs ® < hearts ™ < spades ́ranks: The ranks will be ordered (READ CAREFULLY)2 < 3 < · · · < 9 < 10 < Jack < King < Queen < AceIn the Card2 class, the compareTo() method orders cards solely by rank as follows:ranks: The ranks will be ordered (READ CAREFULLY)Ace < 2 < 3 < · · · < 9 < 10 < Jack = King = Queen︸︷︷︸considered equal Now suppose that you have an array (AbstractCard[]) that contains both Card1 objects andCard2 objects and you want to sort the array using bubble sort. The pseudocode for bubble sortis as follows:procedure bubbleSort (A : list of sortable items)n := length(A)print "initial:", the list Arepeatswapped := falsefor i := 1 to n-1 inclusive do/+ if this pair is out of order +/if A[i-1] > A[i] then/* swap them and remember something changed +/swap(A[i-1), A[i])// <- this is the red lineswapped :- trueend ifend forn := n - 1print "it {i}", the list Auntil not swappedend procedureThe line in red (above) is problematic for a couple of reasons. One issue is that this line cantranslate into java in two ways:if( A[i-1].compareTo (A[i]) > 0 ){if( A[i].compareTo(A[i-1]) < 0 ){version 1:version 2:If we run the bubble sort algorithm using version 1 of the red line on the following list AbstractCard [] cards = {new Card1 ("QD"),new Cardi ("9H"),new Card1("JD"),new Card1 ("AD")};%3Dthe output (what is printed) would be as follows: (colours will NOT be shown, the red indicatevalues that are fixed at the end of the iteration of the repeat loop)initial: [QD, 9H, JD, AD]it 1: [QD, JD, AD, 9H]it 2: [JD, QD, AD, 9H]it 3: [JD, QD, AD, 9H]For cach of the following cases, run the bubble sort algorithm as described in this question. Displaythe output of cach print statement in the bubble sort algorithm as done above. Addappropriate padding so that the colons are lined up in the output (as above). You do NOT haveto use any colours for this.(A) Run the bubble sort pseudocode (using version 1 of the red line) on the following listAbstractCard] carde = {new Card2("QD"),nev Card2 ("9H"),new Card2("JD"),new Card2("AD")};(B) Run the bubble sort pseudocode (using version 1 of the red linc) on the following listAbstractCard (] cards = {new Card2("QD"),nev Cardi ("9H"),new Cardi1 ("JD"),new Card2("AD")};(C) Run the bubble sort pseudocode (using version 2 of the red line) on the following listAbstractCard ] cards = {new Card2("QD"),nev Cardi ("9H"),new Card1("JD") ,nev Card2("AD")};In addition to the code traces, describe the results. Why are the 'sorted' lists different? Explainwhy care must be taken when different subclasses override the compareTo () method differently.Write up your solution to this question in a text file called sorting.txt.

What is the level of suits in poker?There is no color scale in normal poker to match hands. If two…

Answered: In the Card1 class, the compareTo()…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

In the Card1 class, the compareTo() method orders cards by first comparing the card’s suits
and then ranks if needed (when there is a tie). The suits and ranks are ordered as follows:
suits: The suits will be ordered
diamonds © < clubs ® < hearts ™ < spades ́
ranks: The ranks will be ordered (READ CAREFULLY)
2 < 3 < · · · < 9 < 10 < Jack < King < Queen < Ace

In the Card2 class, the compareTo() method orders cards solely by rank as follows:
ranks: The ranks will be ordered (READ CAREFULLY)
Ace < 2 < 3 < · · · < 9 < 10 < Jack = King = Queen
︸︷︷︸
considered equal