Hi, please solve all of them its easy question and I will upvote you immediately

6- Are all the selected paths feasible? If not, select and show that a path is infeasible, if it exists. (0.5 Marks) 7- Implement your test cases using JUnit. (Give Here Screen Shots of your real Tests) (0.5 Marks) \begin{tabular}{l} int binsearch(int X, int V[], int n){ \\ int low, high, mid; \\ low =0; high =n1; \\ while (low V[mid]) \\ low = mid +1; \\ else return mid; \\ \} \\ return 1; \\ F \\ \hline \end{tabular}