Consider the canonical LR(0) parsing of the grammar below using terminals {a,b,c} and non-terminals {A,B,C,S} with S as the start symbol.
Which one of the following options gives the number of shift-reduce conflicts that will occur in the LR(0) ACTION table?