Question about data structures and algorithms. (a) describe in words how you can find floor(sqrt(n)) for any positive integer n using only basic arithmetic operations (add, subtract, multiply, divide, comparison and assignment) where the floor(x) is the largest integer less than or equal to x.

(b) illustrate your algorithm by showing how it will find floor(sqrt(50)).