（a）
(b)
如果MAXPRIMES的值等于3，则n=5的时候将发生数组越界的错误，而n=3的时候程序将正常进行
（c）
n=1
（d）
Node Coverage
TR={1,2,3,4,5,6,7,8,9,10,11,12,13}
Edge Coverage
TR={(1,2),(2,3),(3,5),(5,6),(6,7),(7,9),(6,8),(8,5),(5,9),(9,2),(9,10),(10,2),(2,4),(4,11),(11,12),(12,11),(11,13)}
Prime path Coverage
TR={[1,2,3,5,6,7,9,10],[1,2,3,5,6,8],[1,2,3,5,9,10],[1,2,4,11,12],[1,2,4,11,13],
[2,3,5,6,7,9,2],[2,3,5,9,2],[2,3,5,6,7,9,10,2],[2,3,5,9,10,2],
[3,5,6,7,9,2,3],[3,5,6,7,9,2,4,11,13],[3,5,6,7,9,2,4,11,12],[3,5,6,7,9,10,2,3],[3,5,6,7,9,10,2,4,11,13],[3,5,6,7,9,10,2,4,11,12],[3,5,9,2,3],[3,5,9,2,4,11,13],[3,5,9,2,4,11,12],[3,5,9,10,2,3],[3,5,9,10,2,4,11,13],[3,5,9,10,2,4,11,12],
[5,6,8,5],[5,6,7,9,2,3,5],[5,6,7,9,10,2,3,5],[5,9,2,3,5],[5,9,10,2,3,5],
[6,8,5,6],[6,8,5,9,2,4,11,12],[6,8,5,9,2,4,11,13],[6,8,5,9,10,2,4,11,12],[6,8,5,9,10,2,4,11,13],[6,7,9,2,3,5,6],[6,7,9,10,2,3,5,6],
[7,9,10,2,3,5,6,7],[7,9,2,3,5,6,7],
[8,5,6,8],
[9,2,3,5,9],[9,2,3,5,6,7,9],[9,10,2,3,5,9],[9,10,2,3,5,6,7,9],
[10,2,3,5,6,7,9,10],[10,2,3,5,9,10],
[11,12,11],
[12,11,13],[12,11,12]
(e)Junit进行主路径覆盖测试
测试程序：
测试结果：覆盖率达到100%
