Question 1: (15 Marks) a. Write minimum test cases for statement coverage b. Write minimum test cases for branch coverage c. Find the cyclomatic complexity of the graph using all the formulas we studied in class. d. Identify a set of basis paths for the graph and write its test cases. #include using namespace std; int main() { int n,r,sum=0,temp; cout>n; temp=n; while(n>0) { r=n%10; sum=(sum*10)+r; n=n/10; } if(temp==sum) cout