About cut in minimum spanning tree?

In Prim's algorithm, first a vertex(any) is chosen. Now, cut such that, that the chosen vertex belongs to S and rest are V-S . Now, you chose the lightest weight edge and add the connecting vertex to S .

And, you continue doing it till all the vertices are in S .

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.