6 Two algorithms are shown.
\section*{Algorithm 1}
| Line 10 | Input \(P\) |
| Line 20 | Input \(R\) |
| Line 30 | Input \(T\) |
| Line 40 | Let \(I = ( P * R * T ) / 100\) |
| Line 50 | Let \(A = P + I\) |
| Line 60 | Let \(M = A / ( 12 * T )\) |
| Line 70 | Print \(M\) |
| Line 80 | Stop |
\section*{Algorithm 2}
| Line 10 | Input \(P\) |
| Line 20 | Input \(R\) |
| Line 30 | Input \(T\) |
| Line 40 | Let \(A = P\) |
| Line 50 | \(K = 0\) |
| Line 60 | Let \(K = K + 1\) |
| Line 70 | Let \(I = ( A * R ) / 100\) |
| Line 80 | Let \(A = A + I\) |
| Line 90 | If \(K < T\) then goto Line 60 |
| Line 100 | Let \(M = A / ( 12 * T )\) |
| Line 110 | Print \(M\) |
| Line 120 | Stop |
In the case where the input values are \(P = 400 , R = 5\) and \(T = 3\) :
- trace Algorithm 1;
- trace Algorithm 2.