Give an example of an algorithm that should not be considered an application of the brute-force approach

. Give an example of a problem that cannot be solved by a brute-force algorithm.

What is the time efficiency of the brute-force algorithm for computing an as a function of n? As a function of the number of bits in the binary representation of n?

If you are to compute an modmwherea> 1andn is a large positive integer, how would you circumvent the problem of a very large magnitude of an?

A stack offake coins There are n stacks of n identical-looking coins. All of the coins in one of these stacks are counterfeit, while all the coins in the other stacks are genuine. Every genuine coin weighs 10 grams; every fake weighs 11 grams. You have an analytical scale that can determine the exact weight of any number of coins.

Devise a brute-force algorithm to identify the stack with the fake coins and determine its worst-case efficiency class.

What is the minimum number of weighings needed to identify the stack with the fake coins?