Write a program that asks the user to input an integer that is a perfect square. a perfect square is an integer that is equal to the product of another integer with itself; e. g., 16 is a perfect square because it equals 4 times 4. repeatedly force the user to input a new integer until they enter a perfect square. once the user has entered a perfect square, print its square root as an integer. hint: you can modulo a float by 1 to get the decimal part of the float, e. g., 2.75 % 1 equals 0.75, and 5.0 % 1 equals 0.

// program in python

# import math library

import math

#read input from user

num=int(input("enter an integer:"))

while True:

#find square root on input

   s_root=math.sqrt(num)

#find remainder of root

   r=s_root%1

#if remainder if 0 then perfect square

   if r==0:

       print("square root of the number is:",s_root)

       break

   else:

#if number is not perfect square then ask again

       num=int(input("input is not perfect square !!enter an integer again:"))

Explanation:

Read an integer from user.Find the square root of the input number and then find  the remainder of square root by modulo 1.If the remainder is 0 then number is perfect square otherwise ask user to enter an integer again until user enter a perfect square  number.

Output:

enter an integer:12                                                                                                        

input is not perfect square !!enter an integer again:16                                                                    

square root of the number is: 4.0    

answer; i believe the answer is tls,transport layer security;