Question 2. Apply white box techniques on the following code snippet a. Calculate Statement coverage 1. main() 2. \{ 3. int n1,n2,n3; 4. if (n1>=n2&&n1>=n3) 5. printf("\%d n1 is the largest number.", n1); 6. else if (n2>=n1&&n2>=n3) 7. printf("\%d n2 is the largest number.", n2); 8. else 9. printf("\%d n3 is the largest number.", n3); 10. \} b. Calculate Brach coverage read a,b,c; if (a==0b==0) \{ print 1; else { if (c==0&&d==0) \{ print 2; \} ; c. Find the shortest path find out the shortest number of paths following which all the nodes will be covered