C# with screen shot

please

C++programming languages much like the division /, multiplication , addition +, and subtraction functions. This function is lika the division function, however, the idea behind it is that it should provide you with the remainder of two divided integers (think long division) rather than with the answer of that division. For example, if we were to integer divide 5 and 2 (int w=5/2 ) the answer of this division would be 2 (remember this is integer division). However, if we were to mod 5 and 2 (int w=5% 2) then the answer would be 1. Keeping that in mind, if we were to mod the number that is left of the modulus sign with a number that it is divisible by on the right of the modulus sign, what would the answer be? For this exercise, please design a program that determines if the number that was entered in as input by the user is divisible by 2,3 , or 5 . If it is not divisible by any of these numbers, please just print out "This number is undetermined". Disclaimer: The answer that should be provided by your program should be the smallest number that equally divides by the number entered in. For example, 200 in sample output \#2 is both divisible by 2 and by 5 , however, your program should prioritize printing out it is divisible by 2 rather than it being divisible by 5 . Only numbers that are strictly divisible only by 5 should print "This number is divisible by 5 " for example like 25. Remember, the class name should be Lab5B