Please solve these computer science problems from the given book: 1.2.2 Reference book: https://files.gitter.im/SamZhngQing Chuan/sam/DA1g/Steven- Halim-Felix-Halim-Competitive-Programming-3_-The-New- Lower-Bound-of-Programming-Contests-Lulu.com-2013_pdf 2 Steven Halim Felix Halim HANDBOOK FOR ACM ICPC AND IOI CONTESTANTS 2013

Solve this computer science assignment. If you have any problem with the link please comment below: https://drive.google.com/file/d/12GBpVH2- z9Et21tVINKDx3qK-bVARLt1Bx/view

computer problem 1 can be found here:https://www.bartleby.com/questions-and-answers/blems-1.-design-a-monte-carlo-simulation-to-estimate-the-probability-of-a-random-walk-reaching-the-t/0892d4b2-194d-4f0d-869a-ae3b8e101eb9 DON'T LABLE THIS INCOMPLETE UNTIL YOU LOOK AT THAT LINK USE EITHER PYTHON OR MAPLE FOR THESE (or matlab if you know it)DO NOT SOLVE THESE BY HAND. If you solve these by hand I will thumbs down your answer.

We saw the mechanics of Tree Traversals and discussed how they're different from one another, but if we want to write practical software, we also need to know when we should be using the techniques we're learning about. In each of the scenarios described below in which a tree traversal is required, what would be the appropriate kind of tree traversal to use? For each one, briefly explain (in no more than a sentence or two) why. 1. You're writing an analysis tool for a hierarchical organization, in which there is one person fundamentally in charge, to whom some number of people report, to each of whom some number of people report, and so on. There is a ranking in the organization, so the person in charge has rank 1, the people who report to that person have the rank 2, the people who report to the rank-2 people have the rank 3, and so on. Your input is this kind of organizational hierarchy. Your desired output is to be able to find the highest-ranking person (i.e., the person with the…