A linked implementation of a list a) will always require more memory than an array version of the same list. b) will always require less memory than an array version of the same list. c) may require less memory than an array version of the list depending on the data type (both store the same data type). d) may require more memory than an array version of the list depending on the data type (both store the same data type) .