Suppose there are six waiting jobs and the set-up costs incurred between any two jobs are shown below. Determine the sequence in which these jobs should be processed at lowest total set-up cost.

JOBS THAT START		JOBS THAT FOLLOW (ALL COST IN DOLLARS)
		P	Q	R	S	T	Y
	P	0	12,000	9,000	8,000	3,000	4,000
	Q	10,000	0	2,000	7,000	1,000	6,000
	R	1,000	5,000	0	10,000	8,000	4,500
	S	5,000	9,000	8,000	0	4,000	2,500
	T	8,000	7,000	6,000	6,000	0	5,500
	Y	5,500	5,000	6,500	3,500	8,000	0