Choose Fleets

Problem Statement

Choose Fleets Problem Description Given an integer denoting a total number of wheels, find the number of different ways to choose a fleet of vehicles from an infinite supply of two-wheeled and four-wheeled vehicles such that the group of chosen vehicles has that exact total number of wheels. Two ways of choosing vehicles are considered to be different if and only if they contain different numbers of two-wheeled or four-wheeled vehicles. For example, if our array wheels = [4,5,6] our return array would be res = [2,0,1] . Case by case, we can have 1 four-wheeler or 2 two-wheel to have 4 wheels, we cannot have 5 wheels, we can have 1 four-wheeler and 1 two-wheel or 3 two-wheeled vehicles in the final case. Function Description Complete the function chooseFleets in the editor below. The function should return an array of integers representing the answer for each wheels[i] . chooseFleets has the following parameter(s): wheels(wheels[0]...wheels[n-1]): an array of integers Constraints 1 1 Ex