The type of "algorithm analysis$*$ studied and exercised in this course Comp$272$ is concerned with$/2$ marks$12$ marks$$ a designing programs that are easy to maintainb. designing algorithms that are easy to understandc methodologies for proving the correctness of algorithmsd. estimating the resource consumption of algorithmse estimating the work programmers must do to implement algorithmsf. designing algorithms that are easy to extend and modify