You are given an mx n grid representation of a space with several items whereby the shaded cells represents a single item. There is a robot placed at the topmost left cell of the grid. The robot can only make a right or down move to proceed in the space. Whenever the robot enters a shaded cell, it picks up that item and proceed further to pick the next item. Design a dynamic programming based solution for the problem such that the maximum number of items are picked by the robot along its path when it reaches the rightmost grid of the last Row. (Hint: initially the index of items picked will be 0, as soon as an item is picked the index will become 1 and when another item is picked the index will be incremented accordingly. Provide at least three different paths of the Robot to pick the maximum items