0202	90	A
0303	90	A
0404	90	A
0505	100	
0606	90	A
0707	65	B
0808	90	A
0909	90	A
1010	90	A
1212	90	A
1313	100	
1414	90	A
1515	90	A
1616	100	
1717	90	A
1818	90	A
1919	100	
	90.8823529411765	

A	-10	You have not described how to find longest path in a DAG in O(n^2) time.
B		Email Sent