Discrete Math and Algorithms Home Work

*The whole problem is included in a .zip file; I could not include it all otherwise. LOOK AT THE .ZIP FILE TO SEE THE WHOLE PROBLEM ALONG WITH ALL THE INFORMATION. * 1.3: The Average-Behavior analysis of Algorithm 1.1 (Page 36) makes several simplifying assumptions; in particular, it is assumed that no value shows up in two different places in the array. The formula (shown on Page 37) is much more complex if the elements are not distinct. In this problem, you are asked to analyze one such scenario: For simplicity, assume that n is even. Assume that every element in the n-element array shows up exactly twice (so there are n/2 distinct values, and each value occurs in two separate places in the array). Assume the array is unsorted (so the elements are 'randomly scattered' throughout the array). Develop a formula for A(n), in terms of n and q (based on the definitions of A, n, and q as on Pages 35, 35, and 37). ## Deliverables The whole problem is included in a .zip file; I could not include it all otherwise. I would like this delivered in a word document. ## Platform The whole problem is included in a .zip file; I could not include it all otherwise. I would like this delivered in a word document.