public static int mystery(int n) {if (n < 0) return -mystery(-n);else if (n < 10) return (n + 1) % 10;else return 10 * mystery(n / 10) + (n + 1 % 10)RecursionHow to get those answers?mystery1(385); answers 1176mystery1(-790); -2391mystery1(89294); 447895