$2.$ The number of operations for an algorithm is T$($n$)=10$n$+4,$ where n is the total number of inputs. Can we say T$($n$)=(2$n$)?$ Please prove your answer.