The above diagram represents the following paths through the code: - Path A: $vwy$ - Path B: $vwz$ - Path C: $vxy$ - Path D: $vxz$ \nWhat is the MINIMUM combination of paths required to provide full statement coverage? \nmermaid\ngraph TD R[Read p,q,r,s] -->|v| C1{p > q} C1 -->|true, w| S1[p = s / p] C1 -->|false, x| C2{p + r < s} S1 --> C2 C2 -->|true, y| S2[r = r * p] C2 -->|false, z| E[End] S2 --> E \nThe paths are: $A=vwy$, $B=vwz$, $C=vxy$, and $D=vxz$.