A large decision tree has an outcome branch detailedbelow. If decisions D1, D2, and D3 are alloptions in a 1-year time period, find the decisionpath that maximizes the outcome value. There arespecific dollar investments necessary for decisionnodes D1, D2, and D3, as indicated on eachbranch.
Computer Science 1400 Fall Semester Section 1 : -Fundamentals of computing -Six concepts of a computer scientists -Algorithms -Picobot state direction arrow -Indexing matching ranking -Word Location Trick ranking metawork trick Altavista -Python compiler interactive mode program input output math conditional execution -Debugging syntax runtime semantic -Natural Languages -Formal Languages parsing -Values integers strings floats variable assignment variable names statements expressions
