Complete the recursive formula of the geometric sequence 27, -9 , 3 , -1, b(1)=
b(n) = bn - 1)

Scott’s bank account showed a balance of $750 on sunday. during the next five days, he made one deposit of $140 and numerous withdrawals of $180 each. let x represent the number of withdrawals that scott made. write an inequality that can be used to find the maximum number of withdrawals that scott could have made and maintain a balance of at least $100. do not use a dollar sign ($) in your response.