Feasability of fork topology without `split`

[romintomasetti]

We'd like to represent the following topology (each node represents some work):

graph TD
    A --> B
    A --> C
    B --> D
    C --> D
    C --> E

    D --> END
    E --> END

Loading

It seems that for such a case, it is possible to use split:

auto A = just() | then(...);

auto B = A | then(...);
auto C = A | then(...) | split();

auto D = when_all(B, C) | then(...);
auto E = C | then(...);

sync_wait(when_all(D, E));

However, P3682 (written by @RobertLeahy) proposed to remove std::execution::split and as far as we understand it, it was approved.

Therefore, how would we represent the above topology, without introducing other dependencies ?

Joint question with @maartenarnst.