Consider the code below, draw flow graph, develop graph matrix, compute cyclomatic complexity and mention the longest independent path. [Total Marks: 5+4+2+2 = 13]

public double calculate(int amount) { double rushCharge = 0;

if (nextday.equals("yes") ) { rushCharge = 14.50; }

double tax = amount * .0725;

if (amount >= 1000) { shipcharge = amount * .06 + rushCharge; } else { shipcharge = 5.25 + rushCharge; }

total = amount + tax + shipcharge; return total;

}

Note:this is a software verification and validation course.