6. Consider the following brute-force algorithm for solving the composite num ber problem: Check successive integers from 2 to ln/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