Algorithms: Acceptable answers in pseudocode or Python

Let G = (V, E, w) be a weighted, undirected graph with nonnegative edge weights. A decycler is a set of edges DCE such that for any cycle C CE, CND. Our goal is to find a decycler of minimum weight. (5 points) Write pseudocode for an algorithm which takes G = (V, E, w) as input, runs in O(E log V) time, and returns a minimum-weight decycler. (2 points) Write pseudocode for a modification to your algorithm to make it work for graphs which can have negative edge weights