A "cut" represent a group of edges in a graph that can separate two nodes if we remove them from the graph. A "minimal cut" represent a group of edges that any subset of it is not a cut. A "minimum cut" represent a cut that contains the smallest number of edges. Consider the graph below. We want to find the cut that separate node A from node B. Please: (1) identify “the minimal cut" that contains two edges and three edges, respectively; (2) identify all “minimum cut” of the graph. F O A B E

Field of study that deals with the protection of computer systems and networks from information disclosure, theft, or damage to their hardware, software, or electronic data, as well as from the disruption or misdirection of the services they provide.