You have the following formula for generating a series of numbers: f (k) = 3k + 1 k = 0 ……, n The content of the directory to be created according to this formula will be as follows: [1, 4, 7, 10, 13,...

You have the following formula for generating a series of numbers:
f (k) = 3k + 1 k = 0 ……, n
The content of the directory to be created according to this formula will be as follows:
[1, 4, 7, 10, 13, 16, ...]
Write the algorithm as pseudocode that find and return the missing element in an array created according to this formula, but with a single element missing.  Time complexity of the algorithm you are writing
It should be better than linear. What technique did you use while writing your algorithm?