Complete 3 to 4 Algorithms and Data Structures assignments

I have a Algorithms and Data structures class. There are 3 or 4 homework assignments left before the class is finished. I need to do very well on them. I am look for someone who can get them completely right. I will pay $30 per assignment. Assignments must be typed and be completely correct. You must be able to write in good english. Here are some sample questions: 1) Give a formula for the total number of operations done by the SequentialSearch algorithm (Algorithm 1.1) in the worst case for an array with n entries. Count comparisons of K with array entries, comparisons with the variable index, additions and assignments to index 2) The median of an ordered set is an element such that the number of elements less than the median is within one of the number that are greater, assuming no ties. a Write an algorithm to find the median of three distinct integers a, b and c. b How many comparisons does your algorithm do in the worst case? On the average? c How many comparisons are necessary in the worst case to find the median of three numbers? Justify your answer.