graph: A B

• B D (B to D and D to B)
• D C (D to C and C to D)
• A C
• C B (C to B and B to C)
• D A

Can the random walk on that graph converge to a stationary distribution starting from a uniform distribution [0.25, 0,25, 0.25, 0.25]? If so, please write down the stationary distribution vector (round to 2 decimal places and write the distribution in the order of [a,b,c,d]). If not, please remove the minimum number of edges so that random walk can converge. We encourage you to solve this problem by writing a program. But code or pseudocode is not required. We will only grade this problem based on the solution.