Encryption has a remarkably long and varied history. spies have been using it to convey secret messages ever since there were secret messages to convey. one powerful method of encryption uses random digits. two documents are prepared with the same random sequence of numbers. the spy is sent out with one and the spy master retains the other. the digits are used as follows. suppose that the word to be encrypted is spy and the random digits are 352. then s becomes v (three letters after s), p becomes u (five letters after p), and y becomes a (two letters after y, restarting at a after z). the spy would encrypt a message and then destroy the document used to encrypt it. this is an early example of a. a hashing algorithm. b. asymmetric key encryption. c. symmetric key encryption. d. public key encryption.

This problem has been solved! see the answeran evil king has a cellar containing n bottles of expensive wine, and his guards have just caught a spy trying to poison the king’s wine. fortunately, the guards caught the spy after he succeeded in poisoning only one bottle. unfortunately, they don’t know which one. to make matters worse, the poison the spy used was very deadly; just one drop diluted even a billion to one will still kill someone. even so, the poison works slowly; it takes a full month for the person to die. design a scheme that allows the evil king to determine exactly which one of his wine bottles was poisoned in just one month’s time while expending at most o(logn) of his taste testers.you are not allowed to use n testers, one for each bottle, and see which one tester dies after 30 days.(no pseudocode needed. just answer in words, how many testers you use, how you use them and why you correctly identify the poisoned bottle in 30 days)

Which one of the following is considered a peripheral? a software b mouse c usb connector d motherboard

Worth 50 points answer them bc i am not sure if i am wrong