Find the number of all elements of an integer array that are positive two-digit numbers. Pascal.

program zz1;
const n = 30; // set the number of elements in the array
var i, k, s: integer; // set variables of integer type
m: array [1..n] of integer;
begin
for i: = 1 to n do // write numbers in the array at random
m [i]: = random (201) -100;
for i: = 1 to n do // display the array on the screen
write (m [i], ”);
writeln; // go to a new line to display the response
for i: = 1 to n do
if (m [i]> 0) and ((m [i] <100) or (m [i]> 9)) then k: = k + 1;
if k = 0 then writeln (‘no items found’) else writeln (‘number of items found =’, k); // display the answer
end.