Coin Sorting Machine --------------------------- 

***We can only have two classes and we have to use public static void print(CoinStack[] cs) in order to print output.

1. Write a java class called CoinStack.java, which implements CoinStackInterface

2. Write your application named CoinStackApp.java that read coins (three data files are provided for testing purpose): Construct 4 stacks (for penny, nickel, dime, and quarter stack), read coins from the data file then push to their corresponding stacks. For example, if the value is 10, then you need to push that coin to dime stack.

3. The print the four coin stacks as shown below. Hint: You may implement and use the method as spcified below: public static void print(CoinStack[] cs)

Here is a sample output: | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |-----| | | | | | | |-----| | | | | | | |-----| | | | | | | |-----| |----| | | | | |-----| |----| | | | | |-----| |----| |------| | | |-----| |----| |------| | | |-----| |----| |------| |----| |-----| |----| |------| |----| |-----| |----| |------| 

given: Coin.java

public class Coin{ int value; Coin next; public Coin(int value){ this.value=value; } public void setLink(Coin coin){ this.next=coin; } public Coin getLink(){ return next; } public int getValue(){ return value; } }

coins.txt

5 10 25 1 10 1 25 1 10 25 1 5 10 10 10 10 10 1 1 5 25 25 25 10 10 5 25 1 10 1 1 5 1 25 10 25 25 1 25 10 5 10 25 25 10 25 10 5 5 25 10 25 5 25 5 5 5 5 10 5 10 5 10 1 10 5 25 5 10 25 10 1 5 25 1 25 10 5 10 1 25 5 5 1 1 10 5 1 25 25 1 5 10 1 5 1 5 10 10 1