What are the cost functions of these algorithms (Please show working)?

Algorithm 1:

Algorithm 2:

input: n-bit integer X // see not below the algorithm output: list of prime factors and their multiplicity acc = X for i-2 sqrt( X ) count = 0 while acc % i =- acc = acc / i count - count+1 if count 0 print i (count) Note: Recall that the range of values of an n-bit integer is 0...2" input: n-bit integer X // see not below the algorithm output: list of prime factors and their multiplicity acc = X for i-2 sqrt( X ) count = 0 while acc % i =- acc = acc / i count - count+1 if count 0 print i (count) Note: Recall that the range of values of an n-bit integer is 0...2