Time complexity of determining whether two elements are adjacent in an adjacency list

Question

I think the time complexity of determining whether two vertices, v and u , are adjacent is O(max(deg(v), deg(u)) + 1), however, my solution says min instead of max. Could so