Помагите пожалуйста сделать блок схемы к этим заданиям

var a,x,N,xn,xk,y,K:real;
begin
  write('N='); read(N);
  write('a=');read(a);
  write('xn=');read(xn);
  write('xk=');read(xk);
  K:=(xk-xn)/N;
  y:(cos(xn)*cos(xn)*cos(xn)*cos(xn)+cos(a)*cos(a)/(cos(a*x)+1.5);
  wrieteln('y=',y:4:2);
  while xk>xn do
  begin
    xn:=xn+k
    writeln ('xn=',xn:4:4);
    y:=(cos(xn)*cos(xn)*cos(xn)*cos(xn)+cos(a)*cos(a)/(cos(a*x)+1.5);
    writeln ('y=',y:4:4);
  end;
end.

Program num5;
UsesCrt;Varxn, xk, Step : real;StepNum,i , j , m , n : Integer;x : real;S1, P2 : real;Sum : real;
 
Begin
ClrScr;
 
Write ('Input m : '); ReadLn (m);Write ('Input xn: '); ReadLn (xn);Write ('Input xk: '); ReadLn (xk);Write ('Input n : '); ReadLn (n);
 
 
 
Sum := 0;
 
x:= xn;
 
Step := (xk - xn) / n;StepNum := 0;
 
RepeatStepNum:= StepNum + 1;Sum := Sum + Sqrt (2 * x);
 
S1 := 1;For i := 2 to m doS1 := S1 *(x+sqr(i))/(2*x+i);
 
Sum := Sum + S1;
 
P2 := 0;For j := 2 to (m+1) doP2 := P2 + Sqrt(j);
 
Sum := Sum + P2;
 
WriteLn (StepNum:4, x:7:2, Sum:15:3);
 
x := x + Step;Until StepNum > n;End.

var
N, I: Integer;
X, Y, A, B, C: Real;
begin
Writeln('введите N');
Readln(N);
Randomize;
for I := 1 to N do
begin
Write('Введите элементы A[', I, '], B[', I, '], C[', I, '] через пробел');
Readln(A, B, C);
X := A;
if B > X then X := B;
X := X / 2;
Y := B;
if C > Y then Y := C;
Y := Y / 2
Write('X[', I, ']=', X[I]: 8: 3, ' Y[', I, ']=', Y[I]: 8: 3)
end;
end.
 
 
 
Program num8;uses crt;
 
 
const N=5;
M=5;
 
 
type MassType=array [1..N,1..M] of integer;
 
 
var B:Masstype;
Num:integer;
 
 
procedure InputMassiv(var A:Masstype);
var j,k:integer;
begin
writeln('Fill the massiv:');
for j:=1 to N do
for k:=1 to M do
begin
writeln('A[',j,',',k,']=');
readln(A[j,k]);
end;
end;
 
 
procedure OutPutMassiv(var A:Masstype);
var j,k:integer;
begin
clrscr;
for j:=1 to N do
begin
for k:=1 to M do
begin
write(A[j,k],' ');
end;
writeln;
end;
end;
 
 
procedure MakeTask(var A:Masstype);
var j,k,i,Umn:integer;
plent:set of 1..M;
Mark:boolean;
begin
plent:=[];
Mark:=true;
for j:=1 to N do
for k:=1 to M do
begin
Sum:=0;
plent:=plent+[k];
for i:=1 to N do