Lower and upper bound of algorithms
 

Hi to all of you! I'm new to this,so I could use a little help! I've been given some algorithms and I've been asked to find an upper and lower bound of the time complexity of them. First of all, I would like to know if finding the upper and lower bound means finding the O and Omega time of them....