29. Given a list of natural numbers d.de...... show how to decide in polynomial time whether there exists an undirected graph G=(V.) whose node degrees are precisely the numbers d.de..... That is, if V w. ... . then the degree of should be exactly d.) should not contain multiple edges between the same pair of modes, or "loop" edges with both endpoints equal to the same node. 29. Given a list of natural numbers d.de...... show how to decide in polynomial time whether there exists an undirected graph G=(V.) whose node degrees are precisely the numbers d.de..... That is, if V w. ... . then the degree of should be exactly d.) should not contain multiple edges between the same pair of modes, or "loop" edges with both endpoints equal to the same node