Read the following code and determine what goes in blank #1. int length(nodetype* list) // pre: list has been initialized. // post: length returns the number of elements in list. no counter is kept as // part of the list. this function is recursive. { if // 1 ; // 2 else // 3 } a. list == null b. list-> info = 0 c. list-> next == null d. list ! = null