I'll give some hints as plain text, do try to have a go at solving the questions with this help before revealing the spoilers.
The first part you should be able to answer very easily - check the definition of a linear grammar, how many non-terminals can be on the right-hand side of the production?
At most one, so this isn't a linear grammar, let alone right-linear.
For the second part, perhaps one way to approach it is to first build an NFA that recognises the same language that the grammar generates, then you can use the transitions of the NFA to generate the transitions of the grammar.
$B\rightarrow 1B \;|\; 0B \;|\; C$
$C \rightarrow 1D$
This grammar is certainly not the only one, but should look something like an NFA for the same language - the non-terminals are states, and $D$ is the accept state.