I do not understand the following questions:

Question 1:

Some systems use a branch prediction method known as static branch prediction, so called because the prediction is made on the basis of the instruction, without regard to history. One possible scenario would have the system predict that all conditional backward branches are taken and all forward conditional branches are not taken. Recall your experience with programming in the Little Man Computer Language. Would this algorithm be effective? Why or why not? What aspects of normal programming, in any programming language, support your conclusions?

Question 2:

Suppose we are trying to determine the speed of a computer that executes that Little Man instruction set. The LOAD and STORE instructions each make up about 25% of instructions in a typical program; ADD, SUBTRACT, IN, and OUT, take 10% each. The various branches each take about 5%. The HALT instruction is almost never used (a maximum of once each program, of course!). Determine the average number of instructions executed each second if the clock ticks at 100MHz. (Note: Where it states The various branches each take about 5% assume that BR instructions take 5% and BRZ/BRP instructions (together) take 5%. That is, assume for this question that 10% of instructions in a typical program are branches (5% BR and 5% other types of branches).)