how would I solve this and the answers to each box and questions

You will be using the Virtual Machine and the Invitation.jar files. You will be using the Search Animato and the Sort Animator. Sequential Search: works with an ordered/unordered list Start with the Search Animator, click on Algorithm and choose Search for Value (Sequential Search). Click on Input Data Set. Enter the following data: 5 10 15 20 25 30 35 40 Click on the Step button and count the indexes as you go through the algorithm (You are counting how many times the while loop runs, lines 4-8.) Value to Find 35 Comparisons 10 20 45 Binary Search: list needs to be in order Start with the Sort Animator, click on Algorithm and choose Binary Search (last choice). Click on Input Data Set. Enter the following data: 5 10 15 20 25 30 35 40 Click on the Step button and count the mid as you go through the algorithm (You are counting how many times the while loop and nested if-else statement runs; lines 5-12). Value to Find Comparisons 35 10 20 45 Looking at the comparisons for each of the above searching algorithms, which algorithm would you Judge to be most efficient? Sequential or Binary