Thank you!

Does either Prim's or Kruskal's algorithm work if there are negative edge weights Explain. Give an algorithm to find a maximum spanning tree in a connected undirected graph. You are given a set of N sticks, which are lying on top of each other in some configuration. Each stick is represented by its two endpoints, which are ordered triple representing its x, y, and z coordinates. No stick is vertical, and a stick may be picked up only if there is no stick on top of it. Give an algorithm that determines whether it is possible to pick up all the sticks, and if so, provides a sequence of stick pickups that accomplishes this