$($h$)(2$ points$)$ If $A$ is in $NP$ then $A$ is a decision problem.

True

False

Unknown

$($i$)(2$ points$)$ If $G$ is a connected undirected graph with one cycle then removing the heaviest edge of the cycle will result in an MST of $G.$

True

False

$($j$)(2$ points$)$ Find the value of the maximum flow from $s$ t$.+$ of $+.-$ llowing graph: