```python
def permute_string(str):
    """
    Prints all permutations of a given string including duplicates.

    This function uses a recursive helper to build permutations.
    """
    
    def find_permutations(prefix, remaining_chars):
        """
        Recursively finds and prints permutations.

        :param prefix: The string permutation built so far.
        :param remaining_chars: The characters left to use for the permutation.
        """
        # Base case: If there are no characters left to add, we have a
        # complete permutation, so we print it.
        if len(remaining_chars) == 0:
            print(prefix)
            return

        # Recursive step: For each character in the remaining set...
        for i in range(len(remaining_chars)):
            # ...choose the character and form the new prefix and remaining set.
            new_prefix = prefix + remaining_chars[i]
            new_remaining = remaining_chars[:i] + remaining_chars[i+1:]
            
            # Recurse with the new state.
            find_permutations(new_prefix, new_remaining)

    # Start the recursion with an empty prefix and the full input string.
    find_permutations("", str)
```