a$)$ Solve the following problem using the concept of Row Column dominance, Branch and Bound Method:

as shown in image:

R$1$ goes to sights A$,$ B$,$ F$,$ and G$.$

R$2$ goes to sights B$,$ D$,$ G$,$ and J$.$

R$3$ goes to sights C$,$ E$,$ I, and K$.$

R$4$ goes to sights D$,$ E$,$ J$,$ and K$.$

R$5$ goes to sights F$,$ G$,$ H$,$ and J$.$

R$6$ goes to sights H$,$ I, J$,$ and K$.$

Use a technique to recommend the most minimal number of routes that Debjit needs to take.

b$)$ Use the Tabular Covering approach along with the branching method to find the minimal SOP for the function $z$ where $z(w,x,y,z)={\displaystyle \underset{m}{\overset{?}{}}}(0,2,4,5,7,10,11,15).$