Each of n keys in an array may have one of the values red, white, or blue. Give an efficient algorithm for rearranging the keys so that all the reds come before all the whites, and all the whites come before all the blues. (It may happen that there are no keys of one or two of the colors.) The only operations that are permitted on the keys are examination of a key to find out what color it is, and an exchange of two keys (specified by their indices). How many key examinations and exchanges does your algorithm perform in the worst case

The answer would be d (tables)

Ithink the answer is b 

Yeah they want to steal your info and sell it on the dark web. they want your credit/debit card numbers, social security numbers, google passwords, and other stuff. some people install spyware onto your device, which, as the word suggests, is built to spy on your every move, such as what you type. they then sell this information to other people secretly or use it for evil purposes themselves. or both, idk. the reason why this info costs money to learn is because its valuable info. im not saying that i condone it though! hacking sucks, and whoever is involved in it is just a horrible person.