$4\mathrm{.}1$ Applied Lab: Card Applications In this lab, we will write an application to store a deck of cards in a linked list, and then write methods to sort and shuffle the deck. Step $1$: Copy your LinkedList Copy your completed LinkedList class from Lab $4$ into the LinkedList.java file below. Step $2$: Implement the methods of the Card class Complete all methods of the Card class as described by the Javadoc comments. The class contains both a suit and a rank. A suit is one of the categories into which the cards of a deck are divided. The rank is the relative importance of the card within its suit. Note that the Card constructor must convert any rank and suit letters to uppercase. For the equals$()$ method, be sure to follow the steps outlined in Lesson $4.$ If you did not learn how to implement the compareTo$()$ method in your prior course, read the tutorial here. Note that you are not allowed to add any additional methods or member variables to this class or you will not receive credit for this assignment. Step $3$: Implement the methods of the CardApp class Complete all methods of the CardApp class in the CardApp.java file as described by the Javadoc comments. You may add as many methods as you would like to this file, but are not allowed to add any additional member variables. The CardApp program must prompt for and allow the user to enter the name of any input file as shown in the Example output below. Enter the name of a file containing a deck of cards: cards$1.$txt Please open shuffled.txt and sorted.txt$.$ Goodbye! Implement the shuffle$()$ method as specified in the comments for shuffle$().$ After you have shuffled the deck of cards, write the result into a file named shuffled.txt$.$ Implement the sort$()$ method using bubble sort from Lesson $4.$ First sort by suit in alphabetical order and then by rank from $2$ to A$.$ The pseudocode for bubble sort is as follows: for i $=0$ up to and including length $-2$ for j $=0$ up to and including length $-$ i $-2//$each pass make fewer comparisons if A$[$j$]>$ A$[$j$+1]$ A$[$j$]<--->$ A$[$j$+1]//$swap After you have sorted the deck of cards, write the result to a file named sorted.txt$.$ The CardApp.java file also contains the main$()$ method of the application. Use Develop mode to test your CardApp code along with your Card and LinkedList code. All input and output files must contain a list of cards, with each card stored on its own line. See the example files cards$1.$txt and cards$2.$txt for example file formats. Simple Shuffle Example: The below example is intended to help you verify that you understand how to shuffle the cards Before shuffling: $2$H $3$H $4$H $5$H $6$H $7$H $8$H $9$H $10$H JH First and last swapped: JH $3$H $4$H $5$H $6$H $7$H $8$H $9$H $10$H $2$H Swapped $3$H and $6$H JH $6$H $4$H $5$H $3$H $7$H $8$H $9$H $10$H $2$H Swapped $5$H and $8$H JH $6$H $4$H $8$H $3$H $7$H $5$H $9$H $10$H $2$H Swapped $7$H and $10$H JH $6$H $4$H $8$H $3$H $10$H $5$H $9$H $7$H $2$H $***$End first set of swaps$***$ JH $6$H $4$H $8$H $3$H $10$H $5$H $9$H $7$H $2$H Swapped $6$H and $8$H JH $8$H $4$H $6$H $3$H $10$H $5$H $9$H $7$H $2$H Swapped $4$H and $3$H JH $8$H $3$H $6$H $4$H $10$H $5$H $9$H $7$H $2$H Swapped $6$H and $10$H JH $8$H $3$H $10$H $4$H $6$H $5$H $9$H $7$H $2$H Swapped $4$H and $5$H JH $8$H $3$H $10$H $5$H $6$H $4$H $9$H $7$H $2$H Swapped $6$H and $9$H JH $8$H $3$H $10$H $5$H $9$H $4$H $6$H $7$H $2$H Swapped $4$H and $7$H JH $8$H $3$H $10$H $5$H $9$H $7$H $6$H $4$H $2$H Swapped $6$H and $2$H JH $8$H $3$H $10$H $5$H $9$H $7$H $2$H $4$H $6$H $***$End second set of swaps$***$ After shuffling: JH $8$H $3$H $10$H $5$H $9$H $7$H $2$H $4$H $6$H $-$