With the given two positive integers a and b. In one move you can increase a by 1(replace a with a + 1). Your first task is to find the minimum number of moves youneed to do in order to make a divisible by b and your second task is to find theminimum number of moves you need to do in order to make a be the squarenumber of b. (Note: It is possible that you have to make 0 moves, if a is alreadydivisible by b and/or if a is already the square of b) Create a Java program that willperform the algorithm that will solve theproblem using inheritance as shown in thefigure.Main ClassAsk for the values of integer a and bwhere a should be greater than b.Create an instance of Divisible and callthe method formula().• Create an instance of Square and call themethod formula).Divisible ClassThe algorithm that will count the numberof moves needed to make a be divisibleby b.o Square ClassThe algorithm that will count the numberof moves needed to make a be thesquare number of b.DivisibleMainformula(int x, int y)objl. formula(int x, int y)obj2. formula(int x, int y)Squareformula(int x, int y)

Answered: With the given two positive integers a…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

With the given two positive integers a and b. In one move you can increase a by 1
(replace a with a + 1). Your first task is to find the minimum number of moves you
need to do in order to make a divisible by b and your second task is to find the
minimum number of moves you need to do in order to make a be the square
number of b. (Note: It is possible that you have to make 0 moves, if a is already
divisible by b and/or if a is already the square of b)