software testing.

(a) Draw the DD graph for the program. (b) Calculate the cyclomatic complexity of the program using all the methods. (c) List all independent paths.

main() int num, small; int i,j,sizelist, list[10],pos, temps clrscr(); printf(" Enter the size of list : "); scanf("%d",&sizelist); for(i=0;ilist[j]) { Small-list[j]; pos=j; } 6. { 7. 8. 9. } 10. 11. 12. 13. temp=list[i]; list[i]-list[pos]; list[pos]-temp; } printf(" List of the numbers in ascending order : "); for(i=0;i