Read the following code carefully and do as directed: int main() { // Initialising starting number int num = 1; int n=7 // Outer loop to handle number of rows // n in this case for (int i = 0; i < n; i++) { // Inner loop to handle number of columns // values changing acc. to outer loop for (int j = 0; j <= i; j++) { // Printing number cout << num << " "; // Incrementing number at each column num = num + 1; } // Ending line after each row cout << endl; } You need to answer following questions. 1. Draw Control Flow Graph for the given code 2. Highlight all regions in the flow graph separately 3. Using cyclometic complexity formula, calculate number of basis path tests.

You are new to microsoft certification and want to start out by getting a certification geared around windows 8. what microsoft certification should you pursue?

Write a function called checkfactor that takes two arrays of positive numbers, firstnumberrow and secondnumberrow. checkfactor checks if the first entry in firstnumberrow is divisible by the first entry in secondnumberrow, and performs the same operation on the next array elements until all entries have been checked. all the numbers are positive and the number of entries in the arrays are the same. the function should return the identified divisible numbers in two row arrays named firstdivisible and seconddivisible.restrictions: branches or loops should not be used. the code must use the internal mod and logical functions.hint: the mod function should be used to determine if two numbers are divisible. ex: for num1 and num2 if mod(num1,num2) is 0, then the two numbers are divisible.this is matlab

What is the most important for you to choose before you build a network?