On the complexity of realization of the linear function by formulas over finite Boolean bases