Method shift

java/Chapter 3/Question3_1/QuestionB.java:63–79

(int stackNum)

	}
	
	public static void shift(int stackNum) {
		StackData stack = stacks[stackNum];
		if (stack.size >= stack.capacity) {
			int nextStack = (stackNum + 1) % number_of_stacks;
			shift(nextStack); // make some room
			stack.capacity++;
		}
		for (int i = (stack.start + stack.capacity - 1) % total_size; // end of array
					  stack.isWithinStack(i, total_size); 
					  i = previousElement(i)) {
			buffer[i] = buffer[previousElement(i)];
		}
		buffer[stack.start] = 0;
		stack.start = nextElement(stack.start); // move start start
		stack.pointer = nextElement(stack.pointer); // move stack pointer
		stack.capacity--; // return capacity to original
	}
	
	/* Expand stack by shifting over other stacks */
	public static void expand(int stackNum) {