Here is the idea for the first part.
In the canonical space, let $B_{[t_1\ t_2]}$
represent a sample path between $[t_1\ t_2]$. We divide
$B_{[0\ \infty)}$ into segments: $B_{[2^{-(n+1)}\ 2^{-n}]}$, for
$n=...,2,1,0,-1,-2,...$. Now, let's
remove all the segments with $n$ being odd, and use the remaining
segments to construct another path $W_{[0\ \infty)}$ -- and by similar
construction, we can use the ``removed'' segments to construct yet
another path (the second component of the 2-d Brownian motion)
First step: we scale (both in time and value) each remaining segment
$B_{[2^{-(2k+1)}\ 2^{-2k}]}$ to fill up the hole between $2^{-2k}$ and
$2^{-2k+1}$, and define for $t\in (2^{-(2k+1)}, 2^{-2k+1})$ for any
integer $k$ ($k$ can be negative).
$W(t) = \sqrt{3} B(2^{-(2k+1)} + \frac{t-{2^{-(2k+1)}}}{3})$
Now, to make the paths continous at the end points, we define for
$t\in (2^{-(2k+1)}, 2^{-2k+1}]$,
$\tilde W(t) = W(t) + \sum_{i=k}^\infty \left [ W_+(2^{-(2i+1)}) -
W_-(2^{-(2i+1)}) \right ] $
I believe such constructed $\tilde W(t)$ is a Brownian motion, which is
adpated to $(\mathcal F^{B}_t)$, and should be independent of the
second component (constructed using the ``removed segments'').
There are still some details to be figured out around the convergency of
$\sum_{i=k}^\infty \left [ W_+(2^{-(2i+1)}) -
W_-(2^{-(2i+1)})\right ]$.
I think we can prove the convergency using the iterated logrithm
theorem.