Problem Description
Given an N x N matrix where 1 represents a cell that can be visited and 0 represents a blocked cell, find all possible paths from the top-left cell (0, 0) to the bottom-right cell (N-1, N-1). The rat can only move in four directions: up, down, left,