Imagine that there are frogs set up on a graph so that frog a is on point (0,0) frog b is on (0,1) and frog c is on (1,1). Frogs can only move by jumping over aother frog moving horizontally, diagonally, or vertcally 2 points fro wherever they came form. How many if any fros can land on the point (0,1)