An evil king has a cellar containing n bottles of expensive wine, and his guards have just caught a spy trying to poison the kings wine. Fortunately, the guards caught the spy after he succeeded in poisoning only one bottle. Unfortunately, they dont 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 months 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)