Good Afternoon 
   I&#x27;m sorry for the inconvenience,and give you wellness<p>I am a student studying  Computer Science at the  Yarmouk  university of Jordan :)<p>please can you help me to write  implementing or source code file to  the solutions of the following question?<p>Given a list of n natural numbers d1, d2, . . . , dn, show how to decide in polynomial time whether there exists an undirected graph G = (V, E)whose node degrees are precisely the numbers d1, d2, . . . , dn. (That is, ifV = {v1, v2, . . . , vn}, then the degree of vi should be exactly di.) G should not contain multiple edges between the same pair of nodes, or “loop” edges with both endpoints equal to the same node.<p>and the attached file in the solution to  question :)<p>please help me 
please
Algorithm (greedy )