Reference no: EM133270130

Use JAVA

Write a code for below question

You are currently at cell (1, 1) of an N X M grid. There is a rule that decides you can move in the grid to reach the position (N, M). rule is, that if you are at cell (x, y) then from there you can either move to cell (x, x+y) or to cell (x+y, y) in one step. Your task is to find the minimum number of steps that you must take to reach cell (N, M) starting from current po Ai.e. (1, 1) Note: If it is not possible to reach (N, M) from (1, 1), then return -1 as your output. Input Specification: input1: An integer value representing the value of N where 1<=N input2: An integer value representing the value of M where M< 106 Output Return min number of steps SOLVE USING JAVA( use scanner class to pass all inputs)