ngth 1.

    Args:
        start: start offset of the containing span
        end: end offset of the containing span
        n: number of spans to embed

    Returns:
        list if embedded Spans

    &#34;&#34;&#34;
    l = end - start  # length of the containing span
    assert l &gt; 0
    if n == l:
        return [Span(start + i, start + i + 1) for i in range(n)]
    elif n &lt; l:
        slen = l // n
        rem = l - slen * n
        spans = []
        soff = start
        for i in range(n):
    