Q:

Propositional Calculus

In a effort to become a better mathematician.  I am self-studying Logic  using the textbooks "Introduction to mathematical structures  and Proofs" by Larry J Gerstein and "A tour though mathematical Logic" by Robert S Wolf. 
There are two  questions/exercises  that I need guidance and hints in order to solve them.
Question 1 :
Suppose that $P$ is a Boolean combination of statements $Q_1, Q_2,\ldots, Q_n $ Then there is a statement that is propositionally equivalent to $P$ and is in conjuctive normal form i.e. it is the conjunction of disjunction of the $Q_ i$'s  and their negation 
Perhaps I am misunderstanding  the question, but without knowing how  $P$ is made from the $Q_i$ how I am  able to convert  $P$ in to CNF ?
Question 2 :
Let $P$ be the statement "Howard fell" and $Q$ "Howard
broke his leg.”"
With P and Q as given, under what conditions is the statement “P
or Q” true when “or” is exclusive? Inclusive?
Surely  "or" is always inclusive?
Update:
I apologize for this update. However A classmate of mine mentioned passingly that it was possible to proof Question 1 using Disjunctive normal form and   De Morgan's laws 
I am still unsure how to proof this effectively. Introduction and exhaustion have been suggested 

A:

For question 1, answer the question by induction on the length of $P$. For example, if $n=2$, you know that $P$ can be $Q_1\vee Q_2$ or $Q_1\wedge Q_2$ or $Q_1\implies Q_2$ or $Q_1\iff Q_2$ or... (and so on).
Each of the combinations can be written in CNF.
Then, for general $n$, you know that $P$ can be split into two shorter combinations, joined by a logical connective.

