write in java

Problem Description You have A natural number from 1 to A, each occuring exactly once. Now, you choose any of the A (each number being equally likely) numbers and do the following procedures: 1. Initialize a variable step =0. 2. Let X be the current number you have. 3. Randomly choose any divisor of X (each divisor being equally likely) which is not 1 . Let it be Y, now replace X by X/Y. Also, increment step by 1 . 4. If X is not equal to 1 , repeat from 2 nd step. Let expected value of step be represented in the form of a irreducible fraction x/y. Return xy1 mod (109+7), where y1 is the modulo multiplicative inverse of y modulo (109+7). Problem Constraints 1