Program in java. Given the facebook interview question, there is an array of [0?1, ..., numCaves-1] with a policeman and a bad guy. The bad guy may appears in the any position of this array, he will changes his position each day, but can only move left or right by one cell. If the policeman and the bad guy are in the same cell, the bad guy is said to be caught. Given any initial position of the bad guy, the objective is output the policemans strategy that can guarantee to catch the bad guy, and demo the whole process. No, constraints about the movement of policeman.