Plz solve all of them otherwise dislike and dont copy any exited answers

Problem: Performing control flow testing. 1- Draw a control flow graph (CFG) for the binsearch() function given below. (1 Mark) 2- From the CFG, identify a set of entry-exit paths to satisfy the complete statement coverage criterion. (1 Mark) 3- Identify additional paths, if necessary, to satisfy the complete branch coverage criterion. (0.5mark) 4- For each path identified above, derive their path predicate expressions. (1 Mark) 5- Solve the path predicate expressions to generate test input and compute the corresponding expected outcomes. (0.5 Marks)