You are given an undirected weighted graph of n nodes, represented by a 0-indexed list, edges, where edges[i] = [a, b] is an undirected edge connecting the nodes a and b. There is another list succProb, where succProb[i] is the probability of success of traversing the edge edges[i].

Additionally, you are given two nodes, start and end. Your task is to find the path with the maximum probability of success to go from start to end and return its success probability. If there is no path from start to end, return 0.

Constraints:

• $2 \leq$ n $\leq 10^3$

• $0 \leq$ start, end $<$ n

• start $\neq$ end

• $0 \leq$ a, b $<$ n

• a $\neq$ b

• $0 \leq$ succProb.length $==$ edges.length $\leq 2\times10^3$

• $0 \leq$ succProb[i] $\leq 1$ ...