What are the respective number of multiplication operations in Horner's Method and the traditional algorithm for the same purpose?

A

(n) and (log n)

B

(log n) and (n)

C

(n log n) and (n)

D

(n) and (n log n)

E

(n^2) and (n)

F

(n) and (n^2)

G

(n^2) and (n log n)

H

(n log n) and (n^2)