I am ok at programming but I don't get how to compare the number back to check if it's composed of the same numbers in this problem. Even general tips would b super!,

i have so far made a function for multiplying the user inputted number to obtain the number that will need testing for whether it is an anagram or notI am however aware that it has quite a lot wrong with it :P I have other code but this is a little annoying. Also how can I compare the numbers within the user inputted number (if that makes sense)

An anagram number is a number that can be multiplied by at least one single digit number (other than 1)Code:void multiplyNumber(int userInput) while(multiplyBy<9) { int multiplyBy = 2; userInput*multiplyBy = anagramToTest1; multiplyBy++; }

to become an anagram of itself. Any anagrams formed by multiplying an anagram number by a digit are

said to be generated by that anagram number. Two numbers are anagrams of each other if they can both

be formed by rearranging the same combination of digits.

For example:

• 1246878 is an anagram number; multiplying by 6 generates 7481268 or by 7 generates 8728146.

These numbers all contain a single 1, 2, 4, 6, 7 and two 8s.

• 1246879 is not an anagram number.

1(a)

Write a program which reads in a single number (between 1 and 123456789 inclusive)

and determines if it is an anagram number.

If the number is not an anagram number you should output the word NO. If it is an

anagram number you should output each single digit it can be multiplied by to make

an anagram of itself.