Explore the existing CoinRepresentation class to find the static method named Solve. This method must implement your algorithm. It accepts only a single argument: A target value Z that you must match exactly with a set of existing coins. The method must tell Simon the number of ways that his coins can represent the given target value. Note that both the input argument and the output are long integers $($i$.$e$.64-$bit integers designated via the long data type in C#$).$ You may assume that Z will be between $1$ and $1,000,000,000,000,000,000(10"$#$),$ inclusive