The solution is JAVA code

3) A man tries to find the gold in an area but the area is dark. The man in every step makes a random move to east or to west or to nort or to South. The area is a 88 matrix. 1 presents the gold, 0 presents non-gold. Plase solve the problem using oop Fundamentals. (Searching always begins from the cell 0,0 .) Man should be an object, move should be a method for searching, and for every step the variables of man object to hold the position values should be updated. Matrix should be created randomly