private int[] searchForBiggest(){
		//Postcondition: this.width and this.height are set and an array of two
		//		 		 ints which contains biggestHeight and biggestWidth
		//   	 		 Unnecessary, but don't have time to change
		int biggestHeight = 0;
		int biggestWidth = 0;
		
		for(int i = 0; i < repeated.length; i++){
			for(int j = 0; j < repeated[0].length; j++){
				if(repeated[i][j] != null){
					if((int)Math.ceil(repeated[i][j].getWidth()) > biggestWidth){
						width = repeated[i][j].getWidth();
						biggestWidth = (int)Math.ceil(repeated[i][j].getWidth());
					}
					if((int)Math.ceil(repeated[i][j].getHeight()) > biggestHeight){
						height = repeated[i][j].getHeight();
						biggestHeight = (int)Math.ceil(repeated[i][j].getHeight());
					}
				}
			}
		}
		int[] ret = new int[2];
		
		ret[1] = (int)Math.ceil(biggestHeight * scaleFactor);
		ret[0] = (int)Math.ceil(biggestWidth * scaleFactor);
		
		return ret;
	}