Using pseudocode that clearly identifies theuse of a “magic coin” (the guessing step whichis used in NP problems to showcase a yes-no choice). You needto construct a non-deterministic algorithm forTHE STEINER TREE PROBLEM and analyze thealgorithms complexity.
Your pseudocode should not be too long, and should outline majorsteps (including the guessing step) in a C/C++/C# likelanguage.
Expert Answer
Answer to Using pseudocode that clearly identifies the use of a “magic coin” (the guessing step which is used in NP problems to sh…