Part II$.$

$($Full Score: $10$Points$)$

There are $6$ DMUs with a single input and single output case. Assume this is an input$-$oriented CRS problem.

$\backslash$table$[[$DMU$,$A$,$B$,$C$,$D$,$E$,$F$],[$Input$,1,2,4,5,6,7],[$Output$,1,6,7,9,10,8]]$

$(1)$ Plot all the DMUs and the CRS DEA frontier in the figure.

$(2)$ Point out the efficient DMU.