B. Prove: For all integers n > 1, if n is not prime, then there exists a prime number p such that p ≤√n and n is divisible by p.(Hints: Use the result of part (a) and Theorems 4.3.1, 4.3.3, and 4.3.4.)

Will mark the brainliest.paula makes stained-glass windows and sells them to boutique stores. if her costs total $12,000 per year plus $4 per window for the frame. how many windows must she produce to earn a profit of at least $48,000 in one year if she sells the windows for $28 each?