Let $K = \mathbb C (x^ay^b,x^cy^d)$ and $L = K(x,y)$.
Observe that by closure, $K$ contains any element of the form
$$(x^ay^b)^{a'}(x^cy^d)^{b'} = x^{a'a+b'c} y^{a'b + b'd}$$
and hence any pair of elements
$$x^{a'a+b'c} y^{a'b + b'd}, x^{c'a+d'c} y^{c'b + d'd}$$
if you identify a pair $(x^ay^b,x^cy^d)$ with the matrix $\begin{bmatrix} a&b\\c&d\end{bmatrix}$ we see that this new pair corresponds to a product
$$\begin{bmatrix} a'&b'\\c'&d'\end{bmatrix}\begin{bmatrix} a&b\\c&d\end{bmatrix} = \begin{bmatrix} a'a + b'c & a'b + b'd\\ c'a + d'c& c'b + d'd\end{bmatrix}$$
This means if we modify our generators of $K$ by "multiplying by the left by invertible (over $\mathbb Z$) matrices", we still get generators of $K$ (under the matrix interpretation above). Also recognize that $n$ is the (absolute value of the) determinant of the matrix corresponding to the generators and so these invertible matrices also preserve that quantity.
In particular, we can exchange our original matrix for one which is triangular by taking of
$$c' = c/\gcd(a,c)$$
$$d' = a/\gcd(a,c)$$
which are coprime because of $p$ divides both quotients then it should have appeared in the $\gcd$! Since they are coprime there exist $a',b'$ such that $a'd' - b'c' = 1$ by the euclidean algorithm, and hence the matrix with those entries has determinant 1.
Now we are very nearly finished. Replace and rename the generators so that we have $K = \mathbb C(x^ay^b,y^d)$ and $ad = n$. It is now evident that $y$ has degree at most $d$ over $K$ and that $x$ has degree at most $a$ over $K(y)$, so multiplication in towers says that $L=K(x,y)$ has degree at most $ad$ over $K$.
That the degrees are exact is tricker. I believe there is an exercise in Lang which does the job or something close(#20 in Chapter V I think, or somewhere around there). But let's try ourselves.
Let's look at the first one: $y$ over $\mathbb C(x^ay^b, y^d)$, $a,d$ nonzero. A polynomial in $K[t]$ with $y$ as a root is
$$f(t) = t^d - y^d$$
By Gauss's lemma, it suffices to prove irreducibility in $\mathbb C[x^ay^b,y^d][t]$. This will be the case by Eisenstein's criterion if the ideal $(y^d)$ is prime in $\mathbb C[x^ay^b,y^d]$, which is obvious by looking at the $x$-degree; if $f(x^ay^b,y^d)g(x^ay^b,y^d)$ is in $(y^d)$ then both $f$ and $g$ are actually degree $0$ in the first coordinate so really we just have $f(y^d)g(y^d)$ is in $(y^d)$ and we want to argue that at least one of the two constant terms is zero, since then that element will be in $(y^d)$. That is, of course, obvious, since if both constant terms were nonzero, so too would be the constant term of the product but then it couldn't be in $(y^d)$.
Now the last step. We want the degree of $x$ over $K(y) = \mathbb C(x^ay^b,y^d,y) = \mathbb C(x^a,y)$ - evidently we can just exchange the roles of $x$ and $y$ in the last proof to verify that the degree of $x$ over this field is $a$.
So it remains to compute the Galois group. Using the matrix interpretation, we can kill our matrix by its adjoint to get $x^n$ and $y^n$ in the ground field. This tells us that the only possible conjugates of $x$ and $y$ are of the form $\zeta x$ and $\zeta y$ where $\zeta$ is an $n$th root of unity. In particular we get all of these after adjoining just $x$ and $y$, so our extension really is normal.
Now, we've already replaced our generators by $x^a y^b, y^d$. Since the Galois group has exactly $n$ elements we will find them by simply counting all the admissible possibilities. In particular, every element corresponds to a pair $(i,j) \in \mathbb Z/n\mathbb Z \times \mathbb Z/n\mathbb Z$ by
$$\sigma_{(i,j)} (x) = \zeta^i x$$
$$\sigma_{(i,j)} (y) = \zeta^j y$$
since they are determined by their action on $x$ and $y$.
So the Galois group can be identified with a subgroup of order $n$ in $(\mathbb Z/n\mathbb Z)^2$. From the degree $a$ extension at the top you can find an explicit collection of elements in the Galois group, namely $(i*n/a,0)$ since that Galois group fixes $y$ (hence the second component is 0) and sends $x$ to $\zeta^i x$ for all $0\leq i \leq a-1$ from the general theory of extensions of the form $k(x)/k(x^a)$ (Lang is a good reference).
On the other hand, the Galois group fixes $y^d$ and so the second coordinate of every element under this identification must be of the form $jn/d$.
Now count the number of elements of the form $(in/a, jn/d)$: there are exactly $a*d$ of these, and any member of the Galois group must be one of these admissible elements. At the same time, the Galois group has $n$ elements, and so all of these must be realized. Thus the Galois group is isomorphic to the subgroup of those elements in $\mathbb Z/n\mathbb Z \times \mathbb Z/n\mathbb Z$, which one can see is generated by $(n/a, 0)$ and $(0, jn/d)$.