8. search benchmarks write a program that has an array of at least 20 integers. it should call a function that uses the linear search algorithm to locate one of the values. the function should keep a count of the number of comparisons it makes until it finds the value. the program then should call a function that uses the binary search algorithm to locate the same value. it should also keep count of the number of comparisons it makes. display these values on the screen.

Martha has a deck of cards. she has lost some of the cards, and now the deck only contains nine spades, eleven diamonds, eight clubs, and twelve hearts. martha predicts that whenever she draws a card from the deck without looking, she will draw a club one-fifth of the time. which activity would best allow martha to test her prediction? a. randomly draw a card from the box and see if it is a club. b. randomly draw a card. then, continue to draw another card until all eight clubs are drawn. c. randomly draw and replace a card 120 times. then, observe how close to 30 times a club is drawn. d. randomly draw and replace a card 100 times. then, observe how close to 20 times a club is drawn.