Anyone familiar with Maple Software. I need to put this problem 5.1 Exercise 1 in Maple using the software functionality to run a sample code for this procedure. Can someone send a snapshot of the running code?

Below is Algorithm 5.1.

Do not know how to approach this in Maple Software.

In the sequential search of Algorithm 5.1, suppose that t = x1 before execution.

How many times will the statement be

ii+1 2

executed? Explain

Algorithm 5.1 Sequential Search. Let x1,x2,...,xn be an array of elements from some set U, and let t e U. The following algorithm performs a sequential search of this array. i 1 while t do i-i+1 if i=n+ 1 then print Element t was not found. else print Element t was found in location i. Algorithm 5.1 Sequential Search. Let x1,x2,...,xn be an array of elements from some set U, and let t e U. The following algorithm performs a sequential search of this array. i 1 while t do i-i+1 if i=n+ 1 then print Element t was not found. else print Element t was found in location