Edge on MST

You are given a weighted graph G = (V, E) with positive weights, c_i for all i member E. Give a linear time (O(abs(E)+abs(V))) algorithm to decide if an input edge e = (u,v) member 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.

Problem 3 Edge on MST You are given a weighted graph G (V, E) with positive weights, ci for E E. Give a linear time (0(El + IVD) algorithnn to decide if an input edge e-(u, v) E, with weight ce is part of some MST of G or not. You should describe your algorithm in words (a list is okay); no pseudocode