Please show ALL steps and explanation in Java with only if/else if statements and for loops (NO METHODS)

The Drunkard's walk. A drunkard in a grid of streets randomly picks one of four directions and stumbles to the next intersection, then again randomly picks one of four directions, and so on. You might think that on average the drunkard doesn't move very far because the choices cancel each other out, but that is actually not the case. Represent locations as integer pairs (x,y). Implement the drunkard's walk by starting at (0,0) then randomly selecting x or y and randomly adding or subtracting 1 from the selected coordinate. Do this 100 times and display the location where the drunkard stopped and their distance from the origin. Run your program 3 times and paste a screenshot of each result. Submit your java program