please check if my answer is correct. question in software testing

Consider the following graph and test paths. N=NO=Nf=E=t1=t2=t3=t4=t5=t6={1,2,3,4,5,6,7,8}{1}{8}{(1,2),(2,3)(2,8),(3,4),(3,5),(4,3),(5,6)(5,7),(6,7),(7,2)}[1,2,8][1,2,3,5,7,2,8][1,2,3,5,6,7,2,8][1,2,3,4,3,5,7,2,8][1,2,3,4,3,4,3,5,6,7,2,8][1,2,3,4,3,5,7,2,3,5,6,7,2,8] 1. Give a minimal set of test paths that achieve node coverage. 2. Give a minimal set of test paths that achieve edge coverage. 3. Identify all the edge pairs (14). 4. Give a minimal set of test paths that achieves edge-pair coverage. Are any edge-pairs missed? 5. Identify all the prime paths (19). 6. Give a minimal set of test paths that achieves prime-path coverage. Are any prime paths missed? Do sidetrips help