You are given a weighted graph G = (V, E) with positive weights, c_i for all i E. Give a linear time (O(|E| + |V |)) algorithm to decide if an input edge e = (u, v) E with weight c_e is part of some MST of G or not.

You should describe your algorithm in words (a list is okay); no pseudocode.