Pick the packages from the heaviest to the lightest one.

Rules

You work in an automated factory that controls a robotic arm to move packages. The arm can pick packages from the conveyor belts to form a stack of packages.

The packages are sorted from the heaviest to the lightest on each of the conveyor belts. Your objective is to pick the heaviest package among the $3$ conveyor belts to move it on a stack.

Implementation

Implement the function solve$($weight$\_0,$ weight$\_1,$ weight$\_2)$ that takes $3$ integhs arguments: weight$\_0,$ weight$\_1$ and weight$\_2.$ These values represent the weight of the packages available on the conveyor belts with respective index $0,1$ and $2.$ When a conveyor belt is empty, the value is $0.$

The function must return the index of the ronvevor helt that has the heaviest nackace For

Console output