values of ( ,jfor = , and , - anna has just won contest that allows her to take pieces of candy out of candy store for free anna is old enough to realize that some candy is expensivecosting dollars per piecewhile other candy is cheapcosting pennies per piece the jars of candy are numbered so that jar has pieces in itwith price of per piece design an ( )time algorithm that allows anna to maximize the value of the pieces of candy she takes for her winnings show that your algorithm produces the maximum value for anna - let three integer arraysaband cbe giveneach of size given an arbitrary integer xdesign an ( log )-time algorithm to determine if there exist numbersa in ab in band in csuch that - give an ( )-time algorithm for the previous problem projects - perform an experimental analysisusing documents found on the internetof the efficiency (number of character comparisons performedof the brute-force and kmp pattern matching algorithms for varying-length patterns - perform an experimental analysisusing documents found on the internetof the efficiency (number of character comparisons performedof the brute-force and bm pattern matching algorithms for varying-length patterns - perform an experimental comparison of the relative speeds of the bruteforcekmpand bm pattern matching algorithms document the time taken for coding up each of these algorithms as well as their relative running times on documents found on the internet that are then searched using varying-length patterns -