Please make the java files that follow the below steps. PLEASE do this as soon as possible.

This assignment is related with the below programs

----------------------------

card.java

----------------------------

import java.util.Random;

public class Card implements Comparable{ private int power; private int toughness; private int cost; private Random random; public Card() { random = new Random(); power = random.nextInt(1000) + 1; toughness = random.nextInt(1000) + 1; } public Card(int x) { if(x=1) { this.power = x; this.toughness = x; calculateCost(); } else throw new IndexOutOfBoundsException("Invalid input"); }

public Card(int power, int toughness) { this.power = power; this.toughness = toughness; calculateCost(); }

public int getPower() { return power; }

public int getToughness() { return toughness; }

private void calculateCost() { cost = (int)(Math.sqrt(1.5*power + 0.9*toughness)); } public int getCost() { return cost; } public void weaken() { power = (int) (power - power*0.1 ); toughness = (int) (toughness - toughness*0.1 ); calculateCost(); } public void boost() { power = (int) (power + power*0.1 ); toughness = (int) (toughness + toughness*0.1 ); calculateCost(); } @Override public boolean equals(Object obj) { if(obj instanceof Card) { Card card = (Card)obj; if(card.getCost() == this.cost && card.getPower() == this.power && card.getToughness() == this.toughness) { return true; } else return false; } else return false; } @Override public String toString() { return "[" + power + "/" + toughness + "]"; }

@Override public int compareTo(Card o) { if(o == null) return -1; if(this.equals(o)) return 0; else if(cost == o.getCost()) { if(power == o.getPower()) return 0; else if(power o.getCost()) return 1; else return -1; }

}

----------------------------------

CardArrayList.java

--------------------------------

public class CardArrayList { private Card cards[]; private int size; private Random random; public CardArrayList(int x) { random = new Random(); if(x>=1) { cards = new Card[x]; size = 0; } else throw new IndexOutOfBoundsException("Invalid Input"); } public CardArrayList() { random = new Random(); clear(); } public int size() { return size; } public void add(Card x) { if(!isRoom()) expand(); cards[size++] = x; } public Card remove() { Card card = cards[size-1]; size--; return card; } public Card remove(int j) { if(jsize-1) throw new ArrayIndexOutOfBoundsException("Index value is out of bounds"); else { Card card = cards[j]; for(int i=j; isize-1) throw new ArrayIndexOutOfBoundsException("Index value is out of bounds"); else return cards[x]; } public int indexOf(Card card) { for(int i=0; i0 && ll; i--) { cards[i] = cards[i-1]; } cards[l] = x; } else { cards[l] = x; } size++; } else throw new ArrayIndexOutOfBoundsException("Index value is out of bounds"); } private void swap(int a, int b) { Card x = cards[a]; cards[a] = cards[b]; cards[b] = x; } public void sort() { for(int i=0; i

---------------------

CardArrayMaster.java

---------------------

/*

* CS 145

*

* Card Array Master is a generic class usefull for you to test your

* CardArrayList class. At the beginning it is heavily commented out

* but as you get more and more working, you can remove sections

* to test various things out.

*/

import java.util.*;

import java.io.*;

public class CardArrayMaster {

public static void main(String[] args) throws Exception

{

PrintStream SO = System.out; // Lazy mode enabled;

// STAGE 1

// Can we add to a master list and print it out?

CardArrayList masterList1 = new CardArrayList();

masterList1.add(new Card());

masterList1.add(new Card(20));

masterList1.add(new Card(10,10));

SO.print("Initial list : ");

SO.println(masterList1);

// STAGE 2

// Can we add a premium card?

masterList1.add(new PremiumCard(100));

SO.print("Premium Card : ");

SO.println(masterList1);

// STAGE 3

// Can we add cars in the middle?

masterList1.add(1, new Card(4,4));

masterList1.add(1, new Card(5,5));

SO.print("Added internal : ");

SO.println(masterList1);

// STAGE 4

// can we add more cards and make it expand?

masterList1.add(new Card(6));

masterList1.add(new Card(7));

masterList1.add(new Card(8));

masterList1.add(new Card(9));

masterList1.add(new Card(10));

masterList1.add(new Card(11));

masterList1.add(new Card(12));

SO.print("After Expand : ");

SO.println(masterList1);

// STAGE 5

// Can we Remove the end value

masterList1.remove();

SO.print("After Remove : ");

SO.println(masterList1);

// STAGE 6

// Does remove return the removed value?

SO.print("Removed value : ");

SO.println(masterList1.remove() );

SO.print("List afterward : ");

SO.println(masterList1);

// STAGE 7

// Did it remove from the middle

// And return the value removed?

Card tmp = masterList1.remove(2);

SO.print("Removed value : ");

SO.println(tmp);

SO.print("List afterward : ");

SO.println(masterList1);

// STAGE 8

// Did get work correctly?

SO.print("Get Values : ");

SO.println(masterList1.get(2) + " : " + masterList1.get(4) );

masterList1.get(2).weaken();

masterList1.get(4).boost();

SO.print("Altered Values : ");

SO.println(masterList1.get(2) + " : " + masterList1.get(4) );

// STAGE 9

// IndexOF

SO.print("Found Success : ");

SO.println(masterList1.indexOf(new Card(110,110)));

SO.print("Found Failed : ");

SO.println(masterList1.indexOf(new Card(99,99)));

SO.print("Found Failed : ");

SO.println(masterList1.indexOf(new Card(600,600)));

// STAGE 10

// Does shuffle work?

SO.print("Before shuffle : ");

SO.println(masterList1);

masterList1.shuffle();

SO.print("Post shuffle 1 : ");

SO.println(masterList1);

masterList1.shuffle();

SO.print("Post shuffle 2 : ");

SO.println(masterList1);

// STAGE 11

// Does Clear Work?

masterList1.clear();

SO.print("After Clear : ");

SO.println(masterList1);

// STAGE 12

// Create a large list

// And check that sort works.

for (int i=0; i

{

masterList1.add(new Card());

}

for (int i=0; i

{

masterList1.add(new PremiumCard());

}

SO.print("Before Sorted : ");

SO.println(masterList1);

masterList1.sort();

SO.print("Success Sorted : ");

SO.println(masterList1);

// STAGE 13

// Can we create a second list

// and make a copy of all NON premium cards

CardArrayList masterList2 = new CardArrayList(1);

for (int j = 0; j

{

if (!(masterList1.get(j) instanceof PremiumCard))

{

masterList2.add(masterList1.get(j) );

}

}

SO.print("Success Removed: ");

SO.println(masterList2);

}

}

----------------------------------

PremiumCard.java

-------------------------------

public class PremiumCard extends Card{

public PremiumCard(int x) throws Exception { super(x); } public PremiumCard(int p, int t) { super(p, t); } public PremiumCard() { super(); } @Override public String toString() { return "{{" + getPower() + "/" + getToughness() + "}}"; } }

CS145-PROGRAMMING ASSIGNMENT #8 MORE WITH CARDS OVERVIEW This program focuses on heaps and using the GUI INSTRUCTIONS Turn in Card.java, CardHeap.java and your main file. You are allowed to reuse your Card.java from a prior assignment with any necessary changes that you want to add IMPLEMENTATION DETAILS: You will reuse your Card.java file and you will write the GUI form and the CardHeap.java files to implement the necessary behavior THE PROGRAM In this assignment, you will implement a simple GUI program that will randomly add/remove cards that are the same as the ones we used in assignment #7 to a heap (Note that we will be ignoring the premium cards, although they should still work.). Your program should look like the following At the beginning CS 145 GUI Assignment-Your Name Here Last Removed Add Cloar CS145-PROGRAMMING ASSIGNMENT #8 MORE WITH CARDS OVERVIEW This program focuses on heaps and using the GUI INSTRUCTIONS Turn in Card.java, CardHeap.java and your main file. You are allowed to reuse your Card.java from a prior assignment with any necessary changes that you want to add IMPLEMENTATION DETAILS: You will reuse your Card.java file and you will write the GUI form and the CardHeap.java files to implement the necessary behavior THE PROGRAM In this assignment, you will implement a simple GUI program that will randomly add/remove cards that are the same as the ones we used in assignment #7 to a heap (Note that we will be ignoring the premium cards, although they should still work.). Your program should look like the following At the beginning CS 145 GUI Assignment-Your Name Here Last Removed Add Cloar