The following fragment of code in Figure 1 show the function to calculating the total price of soft drink orders. The soft drink is sold in boxes of 12 bottles and there are available in three flavour: falvour A (RM60), B(RM80) and C(RM100). int calcPrice (int qttyA, int qttyB, int qttyC, double price){ int discount = 0; 1) if (qttyA == 2) discount = 5; else if (qttyA == 1 && qttyB discount = 8; else if (qttyC == 3) discount = 10; else discount = 2; endir price = ((attyA * 60) + (attyB * 80) + (attyc* 100)) * (100 - discount) / 100; return price; } iv. List down the possible test paths in order to achieve 100% test coverage for branch coverage. (test path should be written using this format: Sn=Cn>..) V. Calculate Cyclomatic Complexity value for path coverage. You may use any of cyclomatic metric formula