Consider the following:

>1)How many connected regions can $n$ hyperplanes form in $\mathbb R^d$? 
 
>2) What if the set of hyperplanes are affine?

(Denote the first as $f(d,n)$ and the second as $g(d,n)$, and assume that $n>>d$)

I saw [here](http://math.stackexchange.com/questions/409518/how-many-resulting-regions-if-we-partition-mathbbrm-with-n-hyperplanes/409642#409642),[here](http://math.stackexchange.com/questions/843834/trying-to-understand-formula-for-counting-regions-of-hyperplane-arrangements-in?rq=1) and [here](http://mathoverflow.net/questions/17202/sum-of-the-first-k-binomial-coefficients-for-fixed-n/17261#17261) that the answer to (1) is
$$f(d,n)=\sum_{i=0}^d {n \choose i}$$

However I find it non-trivial to generalize the proof of $\mathbb R^2$ that was provided to $\mathbb R^d$ (without using "lower"/"upper" descriptions). Is there any "nice" way to show it recursively?

Regarding 2, I have the feeling that $g(d,n)=2^d+2\cdot(n-d)$, since the first $d$ hyperplanes can disconnect it into $d$ regions, and any additional lines will go through two antipodal regions. However, I'm having troubles to show it formally. Another assumption is that the effect of affinity results in lower the dimension by 1, i.e. $g(d,n)=f(d-1,n)$.

Any ideas?

(This is definitely not a homework question, just trying to cut my $d$-dimensional cake fairly among my friends. A reference will also do the trick).