Notes

AMBER:
We will be explaining the flowchart by giving an example

We are starting out by a terminator which is a starting point, and an arrow towards the process declaring INT NUM, REV set to 0 ( rev will store the reversed number) and int last digit.
-then we are inputing num which is 789 which is our first example.
-the next process is 'num' or (789) is not equal to 0, the condition is true so we proceed.
-We find the last digit of 'num', by calculating num or 789 % 10 = 9, the modulo operator (%) calculates the remainder when num is divided by 10 and now 9 will be our last digit
-We update 'rev' by its current value multiply by 10 + lastdigit so 0 * 10 + 9 = 9.
-then Divide num 789 by 10 to remove the last digit (num /= 10).
-now 789 becomes 78 simce the last digit is removed
-then we repeat the process since our flowchart is a loop
-now is ‘num' or (78) is not equal to 0, the condition is true so we repeat the process.
-calculating 78 % 10 is = to 8 which will be our last digit
-We update rev' by multiplying its curret value or 9 to 10 and adding the last digit which is 8 so our rev will be 98
-then lets Divide num or 78 by 10 to remove the last digit
--now 78 becomes 7 simce the last digit is removed
-TRSHIA NOREEN MORADOS WILL BE NOW EXPLAINING THE NEXT PROCESS