You are running out of time but have no idea about the route from Nepal to IIT Guwahati. The various cut-out parts of the map that can help you reach IIT Guwahati are hidden in the houses shown in the figure below. You will get the parts of the map only on delivering the right article(one per house) to all the houses.
(i) An ‘X’ coloured ARTICLE should be delivered to an ‘X’ coloured HOUSE only by using an ‘X’ coloured TRUCK.
(ii) A truck can also carry other coloured articles so that it can place them at any of the CHECKPOINTS from where other truck can later carry it to the destination.
(iii) Trucks can carry any number of articles at a time.
(iv) The main objective is to start all the trucks at the same time, with same speed and deliver the articles without collision of trucks. Also, a truck picks up every article that comes on its way.
(v) Last and the most importantly, the PATHS of the trucks should not overlap at any point other than junctions. At junctions, the paths can though cross each other (but both trucks should not reach that junction at same time which leads to collision). The trucks can move only forward.
Give the total number of articles carried by the red truck on it’s way.
A. 1
B. 2
C. 3
D. 4
