Recall that $X \subseteq 2^{\omega}$ is Turing independent if no $y \in X$ is computable from the Turing join of any finite subset of $X \setminus \{y\}$.

Question 1. Can we construct a Turing independent set $X \subseteq 2^{\omega}$ such that every real is computable from the Turing join of finitely many members of $X$?

Question 2. If the answer to Q1 is no, what happens if we weaken the requirement in Q1 to ``Every real is Turing comparable with the join of some finite subset of $X$"?

TIA.