Ineed : (( i need to divide then put it in simplest form

If a(0,0,0) and b(2,2,2) are points in coordinate space, how many paths are there from a to b that move from one lattice point to another in the positive x-,y- or z- direction?

Ming says that 0.24 > 1/4 because 0.24= 2/4. which best explains mings error

Set $r$ is a set of rectangles such that (1) only the grid points shown here are used as vertices, (2) all sides are vertical or horizontal and (3) no two rectangles in the set are congruent. if $r$ contains the maximum possible number of rectangles given these conditions, what fraction of the rectangles in set $r$ are squares? express your answer as a common fraction.