Stack Data Structure for storing Disk objects

src/Disk.java public class Disk { private int size; public Disk(int size) { this.size = size; } public int getSize() { return this.size; } public String toString() { String answer = ""; for(int i = 0; i < this.size*2; i++) { answer = answer + "="; } return answer; } } src/Driver.javaimport java.util.Random; public class Driver { public static void main(String[] args) throws Exception { TowersOfHanoi toh = new TowersOfHanoi(); toh.display(); } } src/ElasticArray.java public class ElasticArray { private int[] ar; public ElasticArray() { ar = new int[0]; } public void display() { System.out.println("*****"); for(int i = 0; i < ar.length; i++) { System.out.print(ar[i] + " "); } System.out.println(""); } public int length() { return ar.length; } public void add(int val) { System.out.println("Abandoning Old Memory!!!!"); int[] temp = new int[ar.length+1]; for(int i = 0; i < ar.length; i++) { temp[i] = ar[i]; } temp[temp.length-1] = val; ar = temp; } } src/HugeInteger.java public class HugeInteger { private LinkedList theNumber; public HugeInteger(String num) { theNumber = new LinkedList(); for(int i = 0; i < num.length(); i++) { theNumber.addEnd(Integer.parseInt("" + num.charAt(i))); } } public HugeInteger multiply(HugeInteger hi) { try { HugeInteger hiToReturn = new HugeInteger("0"); int carry; int currVal; int currPos1; int currPos2 = hi.theNumber.length()-1; int currNode1; int currNode2; String answer; int padding = 0; while(currPos2 >= 0) { carry = 0; currPos1 = this.theNumber.length()-1; currNode2 = hi.theNumber.get(currPos2).getPayload(); answer = ""; for(int i = 0; i < padding; i++) { answer = answer + "0"; } while(currPos1 >= 0) { currNode1 = this.theNumber.get(currPos1).getPayload(); currVal = (currNode2 * currNode1) + carry; carry =...