There is a zoo with 90 cages inside it. Cages are numbered from 1 to 90 and every cage is occupied by one animal only. One day the zoo keeper decides to release some animals in the forest and for this he defines an algorithm of 90 steps which follows:Step 1 : Reverse the position of all the cages which are divisible by 1.Step 2 : Reverse the position of all the cages which are divisible by 2.Step 3 : Reverse the position of all the cages which are divisible by 3 ……………… ………………Step 89 : Reverse the position of all the cages which are divisible by 89.Step 90 : Reverse the position of all the cages which are divisible by 90.Initially all the cages are closed. After executing all these steps, animals of all the cells which remain open are released.Based on the information given below and answer the following questions.Question: Which of the following cage numbers will be open at the end?

1) cage number 37
2) cage number 56
3) cage number 72
4) cage number 81