D$4[2$ pt$]$ Given the adjacency matrix A$,$ is it possible to start at node $4$ and reach node $2$ in four steps or less? How many different paths between node $4$ and node $2$ are there in ten steps or less? Suppose that the six nodes are labelled $1,2,3,4,5,$ and $6.$ Store your answers in the variables four$\_$to$\_$two$\_$possible$\_$in$\_4\_$or$\_$less $($as a boolean; True or False$)$ and num$\_$paths$\_$four$\_$to$\_$two$\_$in$\_10\_$or$\_$less $($as an int$).$

$A=np.$array$([[1,0,1,0,0,1],$

$[1,1,0,0,0,0],$

$[0,1,1,1,0,0],$

$[0,0,0,1,1,0],$

$[0,0,0,0,1,1],$

$[1,0,0,0,0,1]])$

four$\_$to$\_$two$\_$possible$\_$in$\_4\_$or$\_$less $=$ None

num$\_$paths$\_$four$\_$to$\_$two$\_$in$\_10\_$or$\_$less $=$ None