We have ##7x+9y=85##, but let's consider ##7x+9y=1## for the moment. Since ##\text{gcd}(7,9)=1##, Bezout's identity tells us that the last equations has a solution. We can find such a solution like this:
1) Apply the euclidian algorithm on ##7## and ##9## until you get ##1## as rest (we know that we will get it because ##\text{gcd}(7,9)=1##). Basically you divide the greatest out of ##9## and ##7## by the smallest, then you always divide the divisor by the rest.
$$\begin{align*}
&9=1\times7+\mathbf2\\
&7=3\times\mathbf2+\mathbf1
\end{align*}$$
I have bolded the rests on purpose. Now, what you need to do is put the last equation in the form ##1=...##, then replace the rest from the before last equation in that one without performing calculations on the rests or ##9## or ##7##.
We have:
$$\begin{align*}
\mathbf1&=7-3\times\mathbf2\\
&=7-3\times(9-1\times7)\\
&=7\times(4)+9\times(-3)
\end{align*}$$
This yields us a particular solution ##(4,-3)##.
At this point, you might be tempted by multiplying the whole equation by ##85## to have the solutions ##(4\times85,-3\times85)##, but you can't really have a negative number of records.
For the sake of making the rest a bit general such that you can see the point, I'm going to refer to ##(4,-3)##, i.e the particular solution we have found, as ##(a,b)##.
Since ##7x+9y=1## and ##7\times(4)+9\times(-3)=1##, then ##7x+9y=7\times(4)+9\times(-3)##, or ##9(y+3)=7(4-x)##.
If you look at the last equation, you can see that it is in the form ##9(y+3)=7k##, where ##k\in\mathbb{Z}##. This tells us that ##7## divides ##9(y+3)##.
However, we know that ##\text{gcd}(7,9)=1##, thus ##7## divides ##(y+3)##, hence ##y+3=7k##, or ##y=7k-3##.
If you do the same thing with ##x##, then you'll find that ##4-x=9k##, or ##x=4-9k##.
We now have our general solution for ##7x+9y=1##, which is the couples ##(4-9k,7k-3)##, where ##k\in\mathbb{Z}##.
Multiply the while equation by ##85## and you get ##7(85x)+9(85y)=85##, whose solutions (some, there are actually integer solutions for some non integer ##k##) are ##(340-765k,595k-255)##.
And it seems that there is no solution where both ##x## and ##y## are positive and non zero integers for ##k\in\mathbb{Z}##. So, not sure how you are supposed to find a solution.
I can't delete this, seriously.