Show that for any fixed a and b, there is an algorithm ....?

Show that for any fixed a and b, there is an algorithm to convert an n-digit number from base a to base b with O(n^2) operations. Please Show steps! Thank you!