Suppose we are given an array A that contains n distinct integers. Our goal is to find a "nice" pivot A[m] that has the following property: A[m] lies between the (n/10)-th smallest and the (n/10)-th largest element of A. You have access to a quantum oracle Q that works as follows: Q(A0 ) returns the median of an array A0 in constant time whenever A0 has at most n 1/3 elements. Q does not work when the input array has more than n 1/3 elements. Design and describe an efficient algorithm that returns a nice pivot of A by using the quantum oracle Q. Analyze the running time and argue the correctness of your algorithm. You can assume that it only takes constant time to submit subarray A[i..j] of A to the quantum orcale Q. Creating an array of size k takes Θ(k) time.‘

Create a console project in c#. 1. create an interface "imyinterface. cs" - add a method "string imessage()" 2. create a class named "c1.cs" - add 4 private data members, create property for each data member double loanamnout=0.0; double years=0.0; double interests=0.0; double interestrate=0.0; 3. - add a constructor with parameters to assign values to loanamnout, years, interestrate with values that user entered. 4. - add one method “payinterests()” to return the interests interests = loanamnout * interestrate * years 5. - inheritate "imyinterface", implement the method " imessage()", return string "be ready! ” 6. in program. cs, have users to enter loanamnout, years, interestrate. - call method payinterests() to display total interests. - call imessage() to display "be ready! ”