Hi, you haven't provided the programing language in which you need the code, I'll just explain how to do it using Python, and you can apply a similar method for any programming language.
Answer:
def rightMost(num):
lenNum = len(str(num))
rightNum = num%(10**(lenNum-1))
print(rightNum)
return(rightNum)
Explanation:
In this function we receive an integer number, then we find how many digits this number has, and finally, we find the rightmost digits; the main operation is modulo (takes the remainder after a division), what we want is to take all the digits except the first one, for that reason we find the modulo of the number when divided by ten to the power of the length of the number minus one, for example, if the number is 2734 we divided by 10^(4-1), where four is the length of the number, this way we get 2734/1000 and the module of it is 734.
Answer:
Printed
Explanation:
The job was finished and sent to the printer. In the printer, you have to waite to be printed
