Write a C++ code segment to read an integer value greater than 1 and to compute its greatest divisor that is less than the value itself. For example, if the value is 15, the answer is 5, and if the value is 13, the answer is 1. You compute the greatest divisor of an integer value n greater than 1 that is less than n, by repeatedly dividing that value n by i= 2, then 3, then 4, . . . etc., until you get a remainder of 0 or i *i>= n. If the remainder is 0, then the greatest divisor is n/i, otherwise, it is 1.