This question concerns computational complexity. In this question, the perfect square problem is the problem of determining if a positive integer, n, is a perfect square i.e. if n = x^2 where x is a positive integer. (e) Propose a binary search algorithm, B, that decides the perfect square problem. (f) Based on B, what is the complexity of the perfect square problem? (g) Compare the complexity results from analysis of algorithms A, B and adapted- Heron. You should explain why the analysis produces identical or different classes.

This question concerns computational complexity. In this question, the perfect square problem is the problem of determining if a positive integer, n, is a perfect square i.e. if n = x^2 where x is a positive integer. (e) Propose a binary search algorithm, B, that decides the perfect square problem. (f) Based on B, what is the complexity of the perfect square problem? (g) Compare the complexity results from analysis of algorithms A, B and adapted- Heron. You should explain why the analysis produces identical or different classes.