if with *Write a method that accepts a large string. This method will return true * the string starts with the word "Java". This word can be any variation uppercase or lowercase letters. java Java jAva java javA JAva Java JavA jAVa jAVA jaVA JAVA JAVA JAVA JAVA are all of the possibilites. * * * *

(a) In the binary search algorithm, what are the four cases you have to consider at each iteration and what do you have to do in each case?

I need the answer quickly

1. (3 points) Convert (137)10 to ( ) 16- Show your work to receive credit.

(3) (a) A fair coin is flipped, if it lands on the head side, one dice is rolled and X is the resulted number, if it lands on the tail side, two dice are rolled and X is the resulted sum. Calculate E[X] and V[X]. Write a computer program and carry out a simulation to verify your answers. (b*) A person starts walking home from a bar towards his home. The distance is n blocks. Every hour he either manages to walk one block towards home, or gets confused and picks up a cab back to the bar (each with probability 1/2). At any point, if he is at the bar, he always moves ahead one block. What is the expected time it takes him to get home? (c) Write a computer program' and carry out a simulation to verify your answer. (If you have trouble with part (b), do the computer simulation and formulate a conjecture of the answer for partial credits.)

if it's possible expand each number as a sum of powers of the indicated base . if not explain why not? . and then assume the base 10

Select ALL invalid binary search trees. A) 50 26 86 10 33 62 99