(a) Consider the problem of computing the value of a polynomial of the third order: khai th gii tuy What is the number of test cases one should develop for exhaustive testing assuming that one uses 32 bits to represent real number coefficients? Assuming that each test case uses up to Susec. What time is needed to perform this testing. [9] (b) The fragment of C++ code in Figure 1 describes an algorithm that receives as input an array of integers, T, of size n, of the array and perform a particular task on the values in T' as it executes. (b.1) For T = {10,34,5,-4,-1,2) and n = 6, give the content of T after the of execution Do_it. In general, what does the function Do it do. [6] [6] [6] (b.2) Draw a flowchart( control-flow graph) of this code. (b.3) Propose test cases that achieve edge coverage. 1. int Do_it (int T[], int n) 2. 1 3. 4. 5. 6. 7. 8.) int pos 0,1; for (int i-1; i [1]) posi; return T[pos]; Figure 1: Testing phase (b.4) Suggest test cases for the black box style testing of Do_it. 5 [3]