Consider the following brute-force algorithm for solving the composite number problem: check successive integers from 2 to [n/2] as possible divisors of n. if one of them divides n evenly, return yes (i. e the number is composite) if none of them does, return no. why does this algorithm not put the problem in class p?

Suppose you are an ad-serving company and you maintain a log of cookie data for ads you serve to the web pages for a particular vendor (say amazon). a. how can you use this data to determine which are the best ads? b. how can you use this data to determine which are the best ad formats? c. how could you records of past ads and ad clicks to determine which ads to send to a given ip address? d. how could you use this data to determine how well the technique you used in your answer to part c was working? e. how could you use this data to determine that a given ip address is used by more than one person? f. how does having this data give you a competitive advantage vis-à-vis other ad-serving companies?