Can you help me calculatimg the complexity of funA?

def funA ( m: int, n: int ) - int. Y = 0 + = funb (n) ->o(N) E for I in range ( f ) - O ( N) for ; In range ( m ): -0( M ) r+ = 1 return v O ( ( N * M) + N) def funb (n) -Int: - O( N) G ( N * M ) 9 = 1 for , in range ( n): 9* = 2 return