Will rate as soon as it is completed. Read carefully! Please answer all parts of the following question using only the provided 3 sample codes (LinkedStack.java, Main.java, Stack.java). Output must match the provided sample output. Also please include comments to describe all programming. pokemon.csv can be found at: https://gist.github.com/armgilles/194bcff35001e7eb53a2a8b441e8b2c6

Starter Code:

LinkedStack.java:

public class LinkedStack implements Stack { private Node head; @Override public void push(T item) throws IllegalStateException { if (head == null) { // stack is empty // linked list is empty // special case head = new Node(item, null); } else { // there's at least one item here /* Vertex vtx = new Vertex(v) vtx.next = head head = vtx */ } } @Override public T pop() { return null; } @Override public T peek() { return null; } @Override public boolean isEmpty() { return false; } @Override public int length() { return 0; } private class Node { T data; Node next; public Node(T data, Node next) { this.next = next; this.data = data; } } }

Main.java:

import java.io.File; import java.io.FileNotFoundException; import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Scanner; public class Main { public static void main(String[] args) { List allCards = readCSV("pokemon.csv"); Collections.shuffle(allCards); Stack player = new LinkedStack(); Stack computer = new LinkedStack(); for (int i = 0; i  readCSV(String filename) { File file = new File(filename); List pokemonList = new ArrayList(); try { Scanner scan = new Scanner(file); scan.nextLine(); while (scan.hasNextLine()) { String[] info = scan.nextLine().split(","); // #,Name,Type 1,Type 2,Total,HP,Attack,Defense,Sp. Atk,Sp. Def,Speed,Generation,Legendary Pokemon poke = new Pokemon(info[1], Integer.parseInt(info[6]),Integer.parseInt(info[7])); pokemonList.add(poke); } } catch (FileNotFoundException e) { System.out.println("File not found!"); e.printStackTrace(); } return pokemonList; } }

Stack.java:

public interface Stack { /** * Adds a new entry to the top of this stack. * * @param item An object to be added to the stack. * @throws IllegalStateException- if the element cannot be added at this time due to capacity restrictions */ public void push(T item) throws IllegalStateException; /** * Removes and returns this stack's top entry. * * @return The object at the top of the stack. * @return null if the stack is empty */ public T pop(); /** * Retrieves this stack's top entry. * * @return The object at the top of the stack. * @return null if the stack is empty */ public T peek(); /** * Detects whether this stack is empty. * * @return True if the stack is empty. */ public boolean isEmpty(); /** * Retrieves the number of entries in this stack. * * @return number of entries. */ public int length(); }

We have already used the stack ADT to design a test program. Since ADT's are not concerned about HOW the inner workings are designed and implemented, if we use the same interface, we should be able to use the same exact code for the test cases we developed for the previous assignment if we re-declare all the objects used to a different implementation of the stack ADT that uses linked nodes instead. The stack ADT can also be leveraged to greatly simplify any program that requires a collection of items where operations only occur on one end. It is a great ADT choice simulating any card game where you have a collection of cards that uses a first in, first out behavior. n this assignment, you will be responsible for two parts - Part 1: implement your own version of the stack ADT using linked nodes. Implement all necessary public methods according to the interface. Additionally, override the toString method. - Part 2: design and implement a simple pokemon card game. - In the game, the player gets 10 random cards and the computer gets random 10 cards - which are then stored in stacks. - Each card's information should be imported from the pokemon.csv file. - In each round, the player and computer's top card in the stack will be compared. - If the player's pokemon's attack value is greater than the computer's pokemon's defense value, then player wins the round and gets a point. - At the end of the 10 rounds, display how many points the player earned. ample output: The sample output has no user interaction at all. Round \#: 1 Player: Pokemon { name='Mime Jr.', attack=25, defense =45} Computer: Pokemon { name = 'Smeargle', attack =20, defense =35} \#\#\#\#\# fight! \#\#\#\#\#\# Computer wins this round. Round \#: 2 Player: Pokemon { name = 'Conkeldurr', attack =140, defense =95. Computer: Pokemon { name=' Throh', attack =100, defense =85} \#\#\#\#\# fight! \#\#\#\#\#\# Player wins this round. Round \#: 3 Player: Pokemon { name= 'Skorupi ', attack=50, defense =90} Computer: Pokemon { name = 'Chikorita', attack =49, defense =65.. \#\#\#\#\# fight! \#\#\#\#\#\# Computer wins this round. Round \#: 4 Player: Pokemon\{name= 'Entei ', attack=115, defense =85} Computer: Pokemon { name = 'Steelix', attack =85, defense =200} \#\#\#\#\# fight! \#\#\#\#\#\# Computer wins this round. Round \#: 5 Player: Pokemon { name= 'Clefable', attack =70, defense =73} Computer: Pokemon { name = 'Omanyte', attack =40, defense =100} \#\#\#\#\# fight! \#\#\#\#\#\# Computer wins this round. Round \#: 6 Player: Pokemon { name='Gallade', attack =125, defense =65} Computer: Pokemon { name='Sandslash', attack =100, defense =110} \#\#\#\#\# fight! \#\#\#\#\#\# Player wins this round. Round \#: 7 Player: Pokemon { name='Gliscor', attack =95, defense =125} Computer: Pokemon\{name='Slowbro', attack =75, defense =110} \#\#\#\#\# fight! \#\#\#\#\# Computer wins this round. Round \#: 8 Player: Pokemon { name='AltariaMega Altaria', attack =110, defense =110} Computer: Pokemon { name=' Eelektross', attack =115, defense =80} \#\#\#\#\# fight! \#\#\#\#\#\# Player wins this round. Round \#: 10 Player: Pokemon { name='Sealeo', attack =60, defense =70} Computer: Pokemon { name='Gardevoir', attack =65, defense =65} \#\#\#\#\# fight! \#\#\#\#\#\# Computer wins this round. Round \#: 9 Player: Pokemon { name='Ledian', attack =35, defense =50} Computer: Pokemon { name='Wailmer', attack =70, defense =35} \#\#\#\#\# fight! \#\#\#\#\#\# It's a tie