Hi this is a question from a module I am taking called software engineering.

Can do these question step by step thank you

2. Suppose that all the paths through the CFG shown in Figure 1 are feasible. Calculate the minimum number of test cases for exercising all the paths through the CFG for the following five cases: a) Do not exercise the loop b) Exercise the loop one time. c) Exercise the loop 2 times d Exercise the loop 3 times e) Exercise the loop n times. The answer for e) should be in terms of n. (30 marks) 12 13 10 Figure 1. A control flow graph