$1.$ Answer part a and b for the given predicate P$($n$)$ to be the statement

P$($n$)$: $1+2+...+$n$=$ n$($n$+1)/2$

a$.$ The theorem states that for every positive integer n$,()$ is true.

In an inductive proof of the theorem, what is the base case $?$