2. Fill in the blanks in the following method: // Returns the number of all possible paths from the // point(0,0) to the point(x,y), where x and y are // any non-negative integers. From any point the path // may extend only down or to the right by one unit // (i.e., one of the current coordinates x or y can be // incremented by one). public long countpaths(int x, int y) \{ if (x =0y=0) return else return