For a certain program, $25\%$ of the instructions are LW$,10\%$ are $SW,45\%$ are $R,15\%$ are B$,5\%$ are J$.$ Consider the following three cases: $($i$)$ If there is no pipelining, the average time required for executing one instruction is $L($ns$).($ii$)$ If a $5-$stage pipeline is adopted, the average time required for executing one instruction in the ideal case is M $($ns$).($iii$)$ Assume that the destinations of Branch $($B$)$ and Jump $($J$)$ will not be known until the end of the ALU stage. If every $B$ or $J$ instruction incurs two pipeline bubbles, the average time required for: executing one instruction is $N(ns).L+M+N=K.$ Then

$($a$)K<mn\; id="EditorElement\_393187">1</mn><mn\; id="EditorElement\_393188">3</mn>$

$($b$)13K<mn\; id="EditorElement\_393162">1</mn><mn\; id="EditorElement\_393163">4</mn>$

$($c$)14K<mn\; id="EditorElement\_393132">1</mn><mn\; id="EditorElement\_393133">5</mn>$

$($d$)15K<mn\; id="EditorElement\_393102">1</mn><mn\; id="EditorElement\_393103">6</mn>$

$($e$)16K.$