On the advice complexity of the online L(2,1)-coloring problem on paths and cycles