public static void outputResults(LinkedList largest_formable_words, int formable_word_amount){
		WordNode next_node;
		
		System.out.print("\nLongest Word");
		if(largest_formable_words.getSize() > 1)
			System.out.print("s");
		System.out.print(":");
		
		if(largest_formable_words.getSize() > 0){
			next_node = largest_formable_words.getHead();
			
			for(int i = 0; i < largest_formable_words.getSize(); ++i){
				if((i % 5) == 0)
					System.out.print("\n\t");
				System.out.print(next_node.getWord());
				
				// Adding Commas
				if(((i+1) % (largest_formable_words.getSize())) != 0)
					System.out.print(", ");
				
				next_node = next_node.getNext();
			}
			
			System.out.print("\n\nBesides the longest word, " + (formable_word_amount-largest_formable_words.getSize()) + " words can be formed from other words within the list.");
			
		}else{
			System.out.println("\nNo words could be formed by permutations of other smaller words.\n");
		}
		
		System.out.println('\n');
	}