I POSTED THIS QUESTION BEFORE BUT I CANNOT READ THE ANSWER DUE TO BAD QUALITY, PLEASE DO NOT COPY AND PASTE THAT SOLUTION OR I WILL REPORT YOU TO CHEGG!!!!!!

Suppose you are given a connected graph G, with edge costs that you may assume are all distinct. G has n vertices and m edges. A particular edge e of G is specied. Give an algorithm with running time O(m + n) to decide whether e is contained in a minimum spanning tree of G.