Optimizing Grocery Shopping: Where to Place Your Basket

Suppose Janegetshergroceries from several supermarkets, eachwith a different number of aisles. Suppose Janegets items fromtwo aisles persupermarket visit, and to reduce the amount of carrying she needs to do, she placesa basket at the beginning of one aisle. Assume that Jane will not visit the two aisles more than once.Jane wishes to know which aisle she should place her basket so that she canreduce the distance she needs to walk from where she places the basket to the start of the aisle she picks items from, and from the start of the aisle where she picksitemsfrom to the basket to place herpicked items.Assume the aisles are 1 unit distance from oneanother.Write and expressa program to perform the followingtasks:?Read the number of aisles in the supermarket that Janet is currently at.?Read the two aisles Jane needs to get items from.You can assume that two numbers entered are between 1 and the number of aisles in the supermarket.?Compute and display the minimum distance she needs to walkto the basket.You may applyany algorithm to compute the minimum distance.Refer to FigureQ1 for an examplealgorithm for how the minimum distance can be computed. Suppose there are 5 aislesin a particular supermarket, andJane needs to pick items from aisle 1 and aisle 4