a.控制流程图
b.针对数组越界，即可使t2比t1更容易发现
c.n = 1
d.
Node Coverage：{0，1，2，3，4，5，6，7，8，9，10，11，12}
Edge Coverage：{(0,1),(1,2),(1,9),(2,3),(3,4),(3,7),(4,5),(4,6),(5,7),(6,3),(7,1),(7,8),(8,1),(9,10),(10,11),(10,12),(11,10)}
Prime Path Coverage：
{(0,1,2,3,4,6),
(0,1,2,3,4,6,7,8),
(0,1,2,3,7,8),
(0,1,9,10,11),
(0,1,9,10,12),
(3,4,6,3),
(4,6,3,4),
(6,3,4,6),
(6,3,4,5,7,8,1,2),
(6,3,4,5,7,8,1,9,10,11),
(6,3,4,5,7,8,1,9,10,12),
(6,3,7,8,1,2),
(6,3,7,8,1,9,10,11),
(6,3,7,8,1,9,10,12),
(10,11,10),
(11,10,11)}