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 conclusion? Let L be the line passing through the point P=(2,3,2) with direction vector d[3,0,2]T. Find the shortest distance d from the point P0=(1,3,5) to L, and the point Q on L that is closest to P0 Use the square root symbol ' " where needed to give an exact value for your answer. d=0Q=(0,0,0)