Part a) was asked and answered very recently.
b) In general, we need to know something about the process by which the randomization took place. We assume that the letters were put in a bag, and the bag was shaken. We picked a first letter, then a second.
The probability that the first letter picked is E is $\dfrac{2}{11}$. Given that the first letter picked was E, the probability that the second was E is $\dfrac{1}{10}$. So the required probability is $\dfrac{2}{11}\cdot\dfrac{1}{10}$.
Alternately we can persuade ourselves that the arrangements counted in the recent post are all equally likely. Then we can count the "favourable" arrangements, that is, the arrangements that begin with EE. To count, remove the two E's. We have $9$ letters left, with some repetitions. An argument similar to the one used to count the arrangements of ARRANGEMENT can be used to show that the remaining $9$ letters can be arranged in
$$\binom{9}{2}\binom{7}{2}\binom{5}{2}3!$$
ways. Now divide by the answer to the previous question.
Another way: Let us colour the duplicated letters in ARRANGEMENT, to make them all distinct. So we have a red E and a blue E, and so on.
There are then $11!$ words, all equally likely. To count the favourables, the first letter can be chosen in $2$ ways (red E or blue E). For each such choice, the second letter can be chosen in only $1$ way. Now the rest of the letters can be arranged in $9!$ ways. So our probability is
$$\frac{(2)(1)(9!)}{11!},$$
which can be greatly simplified.