Which one of the following assertions concerning code inspection and code walk-through is true?

Consider three software items: Program-$$X,$$ Control Flow Diagram of Program-$$Y$$ and Control Flow Diagram of Program-$$Z$$ as shown below

The values of McCabe’s Cyclomatic complexity of Program-$$X,$$ Program-$$Y,$$ and Program-$$Z$$ respectively are

The following figure represents access graphs of two modules $$M1$$ and $$M2.$$ The filled circles represent methods and the unfilled circles represent attributes. If method m is moved to module $$M2$$ keeping the attributes where they are, what can we say about the average cohesion and coupling between modules in the system of two modules?

The procedure given below is required to find and replace certain characters inside an input character string supplied in array $$A.$$ The characters to be replaced are supplied in array $$oldc,$$ while their respective replacement characters are supplied in array $$newc.$$ Array $$A$$ has a fixed length of five characters, while arrays $$oldc$$ and $$newc$$ contain three characters each. However, the procedure is flawed. void find_and_replace (char $$^ * A,$$ char $$^ * oldc,$$, char $$^ * newc$$)
$$\left\{ \, \right.$$ for (int $$i=0; i<5; i++$$)
for (int $$j=0; j<3; j++$$)
if ( $$A$$ [ $$i$$ ] $$==oldc$$ [ $$j$$ ] $$A$$ [ $$i$$ ]
$$=newc$$ [ $$j$$ ]; $$\left. \, \right\}$$

The procedure is tested with the following four test cases;
$$\eqalign{ & \left( 1 \right)\,\,\,oldc = ''abc'',\,\,newc\, = \,''dab'' \cr & \left( 2 \right)\,\,\,oldc\, = \,''cdc'',\,\,newc\, = \,''bed'' \cr & \left( 3 \right)\,\,\,oldc\, = \,''bca'',\,newc\, = \,''cda'' \cr & \left( 4 \right)\,\,\,oldc\, = \,''abc'',\,newc\, = \,''bac'' \cr} $$

The tester now tests the program on all input strings of length five consisting of characters $$'a', 'b', 'c', 'd'$$ and $$'c'$$ with duplicates allowed. If the tester carries out this testing with four test cases given above, how many test cases will be able to capture the flaw?