identity

Write a function named identity that accepts a string str. The function must generate and print all numeric sequences of the exact same length as str that satisfy the identity matrix rule for str: - The digit at position i of the output sequence must strictly equal the total number of times the character str[i] appears anywhere inside that printed sequence itself. - The arithmetic sum of all digits in the sequence must be equal to the length of str. If str length is greater than 10, or if no valid sequence exists, the function must print nothing. Multiple valid sequences must be printed in ascending numerical order, each followed by a newline (\n).

• Calculate str length and return if len > 10 or len == 0
• Set up a recursive helper function to generate digit combinations of length len
• Stop recursive calls early if the running sum of digits exceeds len
• Check if the digit at index i equals the count of str[i] in the sequence