Test 1 - print empty table
0:	
1:	
2:	
3:	
4:	
-------------------------------------------------------------
Test 2 - processing input file
0:	hello, heath, iiiii, nnnnn, sssss, 
1:	happy, harps, lllll, qqqqq, 
2:	jjjjj, ooooo, ttttt, 
3:	mmmmm, rrrrr, 
4:	kkkkk, ppppp, uuuuu, 
-------------------------------------------------------------
Test 3 - searching
Passed - searching for valid item
Passed - searching for valid item
Passed - searching for valid item
Passed - searching for invalid item
-------------------------------------------------------------
Test 4 - testing remove
0:	hello, heath, iiiii, nnnnn, sssss, 
1:	harps, lllll, qqqqq, 
2:	jjjjj, ooooo, ttttt, 
3:	mmmmm, rrrrr, 
4:	kkkkk, ppppp, uuuuu, 
	-------------------------------------------------------------
0:	heath, iiiii, nnnnn, sssss, 
1:	lllll, qqqqq, 
2:	jjjjj, ooooo, ttttt, 
3:	mmmmm, rrrrr, 
4:	kkkkk, ppppp, uuuuu, 
	-------------------------------------------------------------
0:	iiiii, nnnnn, sssss, 
1:	lllll, qqqqq, 
2:	jjjjj, ooooo, ttttt, 
3:	mmmmm, rrrrr, 
4:	kkkkk, ppppp, uuuuu, 
	-------------------------------------------------------------
0:	iiiii, nnnnn, sssss, 
1:	lllll, qqqqq, 
2:	jjjjj, ttttt, 
3:	mmmmm, 
4:	kkkkk, ppppp, uuuuu, 
-------------------------------------------------------------
Test 5 - output to file


-------------------------------------------------------------
Total collisions = 12
Longest list = 5
Average list length = 2.393750024