The rule of inference behind mathematical induction can be expressed in predicate logic as:

Multiple choice question.

$($P$(1)\backslash$Lambda $$k $($P$($k$)->$P$($k$+1)))->$n P$($n$)$

$($P$(1)\backslash$Lambda $$k $($P$($k$)->$P$($k$+1)))->$n P$($n$)$

$($P$(1)\backslash$Lambda $$k $($P$($k$)->$P$($k$+1)))->$n P$($n$)$

$($P$(1)$k $($P$($k$)->$P$($k$+1)))->$n P$($n$)$