<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def directed_bipartition_of_one(seq):
 """Generate directed bipartitions where one part is of length 1. Args: seq (Iterable):
 The sequence to partition. Returns: list[tuple[tuple]]: A list of tuples containing each of the two partitions. Example: [((1,), (2, 3)), ((2,), (1, 3)), ((3,), (1, 2)), ((2, 3), (1,)), ((1, 3), (2,)), ((1, 2), (3,))] """

    bipartitions = list(bipartition_of_one(seq))
    return chain(bipartitions, reverse_elements(bipartitions))