(e) A student wishes to solve the Minimum Spanning Tree problem using a new algorithm they have devised. They decide to test their new algorithm against the well-known Kruskal and Prim algorithms. Discuss whether the new algorithm is guaranteed to produce an identical tree output as the Kruskal algorithm when provided with the same input graph