Consider a 5-bit input function f (.) where only one input generates 1 the rest generate zeros. We would like to find that input. Input distribution is uniform. 5-(a) What is the average number of guesses we need to make to determine that input using classical way? 5-(b) After the amplitude amplification gate in Grover's algorithm, supposing the input consisting of 1's and -1's, what would the probability amplitudes of 1 and -1 map to? 5-(c) Can we generalize the result of 5-(b) to general n-bits? Consider a 5-bit input function f (.) where only one input generates 1 the rest generate zeros. We would like to find that input. Input distribution is uniform. 5-(a) What is the average number of guesses we need to make to determine that input using classical way? 5-(b) After the amplitude amplification gate in Grover's algorithm, supposing the input consisting of 1's and -1's, what would the probability amplitudes of 1 and -1 map to? 5-(c) Can we generalize the result of 5-(b) to general n-bits