% 1. Matrix Creation
A = zeros(4, 4);
for i = 1:4
    for j = 1:4
        A(i, j) = i + j;
    end
end

% 2. Polynomial Definition
% q(x) = x^3 - 4x^2 + 2x + 1
coeffs = [1 -4 2 1];

% 3. Matrix Transformation
B = zeros(4, 4);
for i = 1:4
    for j = 1:4
        B(i, j) = polyval(coeffs, A(i, j));
    end
end

% 4. Minimum Search using a WHILE loop
min_val = B(1, 1);
min_row = 1;
min_col = 1;

i = 1;
while i <= 4
    j = 1;
    while j <= 4
        if B(i, j) < min_val
            min_val = B(i, j);
            min_row = i;
            min_col = j;
        end
        j++;
    end
    i++;
end

% 5. Output
disp("Matrix B:");
disp(B);
printf("Minimum value: %d\n", min_val);
printf("Position of minimum value: Row %d, Column %d\n", min_row, min_col);