6. Suppose that we want to find the number of occurrences of a key k in...

  

Transcribed Image Text:

6. Suppose that we want to find the number of occurrences of a key k in a given array A[1,...,n]. (Do not assume that elements of A are distinct.) (a) Describe the problem formally, i.e., in the Input Output format. (5 pt) - (b) Design an algorithm to solve the problem. Explain the running time of your algorithm. (15 pt) Please do not submit source code written in a programming language. You may use pseudocode but that is not necessary. If you do not use pseudocode, then you should present your algorithm in the form of Step 1, Step 2, and so on. In either case, you should explain your algorithm. 6. Suppose that we want to find the number of occurrences of a key k in a given array A[1,...,n]. (Do not assume that elements of A are distinct.) (a) Describe the problem formally, i.e., in the Input Output format. (5 pt) - (b) Design an algorithm to solve the problem. Explain the running time of your algorithm. (15 pt) Please do not submit source code written in a programming language. You may use pseudocode but that is not necessary. If you do not use pseudocode, then you should present your algorithm in the form of Step 1, Step 2, and so on. In either case, you should explain your algorithm.