Question:
Minimal test case and loop boundary
Given the following code:
void abcd(int a, int b, int c, int d)
{
int m, i, j;
m=11; i=a+b;
while ((c+d+ I )>i)
{
i=i+1;
j=c+d-a-b-1;
if(j>1)
{
j=m+j;
}
if(m>1)
{
g();
}
}
Generate minimal test cases that satisfies loop boundary adequacy and branch testing: