Consider the following algorithm.

for i {1, 2, 3, 4}

do beep for j {1, 2, 3}

do beep for k {1, 2, 3, 4}

do for l {1, 2, 3, 4, 5}

do

Consider the foliowing algorithm. for fE{1, 2, 3,4} d9 r beep forjE{1,2, 3} do been for kE{1, 2,3,4} do I' for re{1,2,3,4,5} do been for mE{1,2,3,4,5,6} do |_ |_ beep How many times does a beep statement get executed? |:| eBuuk x